[11605] in cryptography@c2.net mail archive
Re: Quantum computers inch closer?
daemon@ATHENA.MIT.EDU (Steven M. Bellovin)
Tue Sep 3 10:35:57 2002
From: "Steven M. Bellovin" <smb@research.att.com>
To: "John S. Denker" <jsd@monmouth.com>
Cc: cryptography@wasabisystems.com
Date: Mon, 02 Sep 2002 21:50:13 -0400
In message <3D73DF30.DD119F1B@monmouth.com>, "John S. Denker" writes:
>
>So let's not guess about what quantum algorithms exist.
>It is possible to construct such algorithms, but it
>requires highly specialized skills.
>
Last time I asked Peter Shor about it, he said that the best known
quantum algorithms for exhaustive key search for classical ciphers was
O(sqrt(key size)). (To me, that's the real reason that AES needs the
option for 256-bit keys...)
--Steve Bellovin, http://www.research.att.com/~smb (me)
http://www.wilyhacker.com ("Firewalls" book)
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
