Re: The effects of quantum computers

From: D. J. Bernstein (djb_at_cr.yp.to)
Date: 09/26/05 

Date: Mon, 26 Sep 2005 11:58:46 +0000 (UTC)

Adam O'Brien wrote:
> Are other types of asymmetric algorithms susceptible to QC's?

Christoph Ludwig has a paper combining Schnorr's random-sampling
lattice-reduction algorithm with Grover's algorithm to attack NTRU. Of
course, Grover's algorithm isn't as scary as Shor's algorithm, but the
NTRU key sizes will need to be increased.

Interested in figuring out more of what cryptography will look like in a
world of quantum computers? ECRYPT is running a workshop on post-quantum
cryptography in Belgium in May: http://postquantum.cr.yp.to

---D. J. Bernstein, Professor, Mathematics, Statistics,
and Computer Science, University of Illinois at Chicago

Relevant Pages

  • Cryptography Scientist wanted in the Bay Area
    ... Cryptography Scientist - Number Theory ... Open on Location (our client has offices worldwide) ... optimization Algorithm design, crypto. ... Prior standards publications pertaining to algorithm development for ...
    (sci.crypt)
  • Re: re:Algorithm
    ... Cryptography is all about analyzing and reviewing the ... When you don't post your algorithm, then how are you going to ... Wem das nicht ...
    (sci.crypt)
  • Re: What algorithm should I use?
    ... Since unknown attacks are unknown it's not reasonable ... Serpent was developed by three well-known cryptoanalysts, ... With what I learned during the last two weeks about cryptography, ... would not take the decision "which algorithm" so seriously. ...
    (sci.crypt)
  • $10,000 for MD5 Collision
    ... Offical Press Release: ... Ottawa - CertainKey, Inc., as a supporter and implementer of strong ... digest (security algorithm) used by companies such as Bank of America, ... According to cryptography industry experts, ...
    (sci.crypt)
  • Re: Prime Decomposition
    ... > large enough that the naieve algorithm is too slow. ... fact in the world of cryptography: ... RSA public-key cryptosystem) relies on the "impossibility" ... of factoring large numbers in a reasonable amount of time. ...
    (sci.math)
Loading