Tracking Cryptographic Systems
Vulnerable to Quantum Attacks
A community-maintained database documenting cryptographic protocols and implementations at risk from quantum computing advances. Shor's algorithm threatens public-key cryptography. Grover's algorithm weakens symmetric systems. The transition to post-quantum cryptography is critical.
The Quantum Threat
Shor's Algorithm can factor large integers and compute discrete logarithms in polynomial time on a quantum computer, effectively breaking RSA, ECC, and Diffie-Hellman—the foundation of modern public-key cryptography.
Grover's Algorithm provides quadratic speedup for unstructured search, reducing the effective security of symmetric algorithms like AES-128 to 64-bit strength.
Current estimates suggest a cryptographically-relevant quantum computer (CRQC) capable of breaking 2048-bit RSA could emerge within 10-15 years. Organizations must begin migration to post-quantum cryptography now.
How It Works
Community Research
Security researchers document cryptographic systems vulnerable to quantum attacks with detailed technical analysis.
Expert Verification
Submissions undergo peer review to verify technical accuracy before publication to the public database.
Public Access
Verified vulnerabilities are published with risk scores, affected protocols, and migration recommendations.