Post-quantum cryptography
Post-quantum cryptography refers to research on cryptographic primitives (usually public-key cryptosystems) that are not breakable using quantum computers. This term came about because most currently popular cryptosystems rely on the integer factorization problem or discrete logarithm problem, both of which would be easily solvable on large enough quantum computers using Shor's algorithm.[1][2] Even though currently known quantum computers are nowhere near powerful enough to attack real cryptosystems, many cryptographers are researching new algorithms, in case quantum computing becomes a threat in the future. This work is popularized by the PQCrypto conference series since 2006.[3][4]
Currently post-quantum cryptography is mostly focused on four different approaches:[4][2]
- Lattice-based cryptography
- Multivariate cryptography
- Hash-based signatures like Lamport signatures
- Code-based cryptography that relies on error-correcting codes
References
- ^ Peter W. Shor (1995-08-30). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer". AT&T Research.
{{cite journal}}: Cite journal requires|journal=(help) - ^ a b Daniel J. Bernstein (2009). "Introduction to post-quantum cryptography" (PDF). (Introductory chapter to book "Post-quantum cryptography").
- ^ "Cryptographers Take On Quantum Computers". IEEE Spectrum. 2009-01-01.
- ^ a b "Q&A With Post-Quantum Computing Cryptography Researcher Jintai Ding". IEEE Spectrum. 2008-11-01.
External links
 | This cryptography-related article is a stub. You can help Wikipedia by expanding it. |