Post-Quantum Cryptography

Code-Based Cryptography; Hash-Based Signatures; Lattice-Based Cryptography; Multivariate Cryptography; McEliece Public Key Cryptosystem; Niederreiter Encryption Scheme; NTRU

Post-quantum cryptography means cryptography resistant to attacks by quantum computers.

Quantum computers are a theoretical model of computation believed to be much more powerful than conventional computers at solving some problems. There have been no public reports of successful construction of large quantum computers, but there are also no known physical obstacles to the construction of large quantum computers.

In 1994, Shor [3] showed that a polynomial-size quantum computer can factor integers and compute discrete logarithms in polynomial time. Shor’s algorithm directly breaks RSA and the Digital Signature Standard in polynomial time. Variations of the same idea break elliptic curve cryptography and more general class-group systems in polynomial time.

For comparison, RSA...

Authors and Affiliations

1. Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA

   Daniel J. Bernstein

Editors and Affiliations

1. Department of Mathematics and Computing Science, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands

   Henk C. A. van Tilborg

2. Center for Secure Information Systems, George Mason University, Fairfax, VA, 22030-4422, USA

   Sushil Jajodia

Reprints and permissions

© 2011 Springer Science+Business Media, LLC

Policies and ethics