Everything about Post-quantum cryptography
Cryptography secured against quantum computers
Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms that are currently thought, but not proven, to be secure against a cryptanalytic attack by a quantum computer. Most widely used public-key algorithms rely on the difficulty of one of three mathematical problems: the integer factorization problem, the discrete logarithm problem, or the elliptic-curve discrete logarithm problem. All of these problems could be easily solved on a sufficiently powerful quantum computer running Shor's algorithm or possibly alternatives. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Post-quantum cryptographyA 5-minute orientation
- Skim a recent paper: Post-quantum cryptography Algorithm's standardization and performance analysisInfluential work since 2022
- Pick up a classic book: Engineering Quantum-Safe Encryption for Real-World SystemsThe most-reprinted book on the subject
- Read the landmark paper: Post-quantum cryptographyCited 917 times
- Go sideways: Lattice-based cryptographyA closely related topic
- Go sideways: NIST Post-Quantum Cryptography StandardizationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Post-quantum cryptography
Transitioning organizations to post-quantum cryptography
Post-Quantum Lattice-Based Cryptography Implementations
Network Coding-Based Post-Quantum Cryptography
Post-quantum cryptography and the quantum future of cybersecurity
Retrofitting post-quantum cryptography in internet protocols
Post-quantum cryptography for automotive systems
Implementing Post-quantum Cryptography for Developers
🆕 Influential since 2022
📚 Books worth reading
Engineering Quantum-Safe Encryption for Real-World SystemsPaul George Savluc · 2026
Post-quantum cryptographyPQCrypto 2010 (2010 Darmstadt, Germany) · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Lattice-based cryptography Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or…
- NIST Post-Quantum Cryptography Standardization Post-Quantum Cryptography Standardization is a program and competition by NIST to update their standards to include post-quantum cryptography. It was announced…
- ML-KEM ML-KEM (Module-Lattice-Based Key-Encapsulation Mechanism), also known by its original name Kyber, is a key encapsulation mechanism (KEM) designed to be…
- Ring learning with errors key exchange In cryptography, a public key exchange algorithm is a cryptographic algorithm which allows two parties to create and share a secret key, which they can…
- NTRUSign NTRUSign, also known as the NTRU Signature Algorithm, is an NTRU public-key cryptography digital signature algorithm based on the GGH signature scheme…
- Falcon (signature scheme) Falcon is a post-quantum signature scheme. It was designed by Thomas Prest, Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky,…
- Ring learning with errors In post-quantum cryptography, ring learning with errors (RLWE) is a computational problem which serves as the foundation of new cryptographic algorithms…
- Elliptic-curve cryptography Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC…