On Sun, Jul 30, 2000 at 01:25:18AM -0400, Jeroen C. van Gelderen wrote:
>Hmm, maybe the complainers should provide proof that they do 
>need more than 2^256 complexity. Makes it easier for us,
>proponents ;-/

How about creating one-time pads?

That said, in Applied Cryptography, Schneier makes the comment (end of
section 7.1) that, based on thermodynamic limitations, "brute force
attacks against 256-bit keys will be infeasible until computers are
build from something other than matter and occupy something other than
space".  (Though it's possible that a quantum computer would meet
those criteria - since it doesn't need to iterate through all possible
keys, it can bypass that part of the second law of thermodynamics).

This implies that if brute force is the best attack against Yarrow-256
(Blowfish), it is unbreakable.  (Of course, that's a big if).

Peter


To Unsubscribe: send mail to [EMAIL PROTECTED]
with "unsubscribe freebsd-current" in the body of the message

Reply via email to