Date: Thu, 3 Aug 2000 06:35:31 +1000 From: Peter Jeremy <peter.jeremy@alcatel.com.au> To: "Jeroen C. van Gelderen" <jeroen@vangelderen.org> Cc: Brian Fundakowski Feldman <green@FreeBSD.ORG>, current@FreeBSD.ORG, Mark Murray <mark@grondar.za>, Kris Kennaway <kris@FreeBSD.ORG> Subject: Re: randomdev entropy gathering is really weak Message-ID: <00Aug3.063533est.115235@border.alcanet.com.au> In-Reply-To: <3983BC3E.B100117D@vangelderen.org>; from jeroen@vangelderen.org on Sun, Jul 30, 2000 at 01:25:18AM -0400 References: <Pine.BSF.4.21.0007292316070.8844-200000@green.dyndns.org> <3983BC3E.B100117D@vangelderen.org>
next in thread | previous in thread | raw e-mail | index | archive | help
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 majordomo@FreeBSD.org with "unsubscribe freebsd-current" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?00Aug3.063533est.115235>