Does anyone know of a recent brute-force work
factor calculation for the various common symmetric ciphers?
I.e. it'll take X 3.2gh Xeons Y years to brute cipher Z.
I know there's a table of these in Schneier and there's the "Seven
Cryptographers" paper but they're
hi.
I tried a programme in C under dos.
It would check 444 words per second on a 133 mega
hertz intel processor
and the same number of checks on a 1 Giga hertz
processor.
Is it because the dos clock runs at a slow constant
speed?
Also what if the same code is ported to unix.Is the
execution