Post-Quantum Cryptography Reference
Reference 为 quantum-resistant cryptographic algorithms across lattice, 代码, hash, 和 isogeny families.
Quantum Threat
Shor's algorithm efficiently factors integers and computes discrete logarithms, breaking RSA and ECC. Grover's algorithm quadratically speeds up brute force, requiring doubled symmetric key sizes. Post-quantum cryptography (PQC) develops classical algorithms resistant to quantum attacks. NIST has standardized ML-KEM, ML-DSA, and SLH-DSA after a multi-year competition.
- Shor
- Breaks RSA/ECC
- Grover
- Halves symmetric security
- migration
- Hybrid during transition
polynomial timeneed 2x keyclassical + PQCAlgorithm Families
Lattice-based schemes (Kyber, Dilithium) offer the best performance balance and are primary standards. Code-based schemes (Classic McEliece) have decades of cryptanalysis but large keys. Hash-based signatures (SPHINCS+, SLH-DSA) rely only on hash security but have large signatures. Isogeny-based schemes (CSIDH) offer tiny keys but remain slow and less mature.
- lattice
- Best balance
- code-based
- Conservative, large keys
- hash-based
- Minimal assumptions
ML-KEM, ML-DSAMcElieceSLH-DSA