Post-Quantum Cryptography: Securing Data Against Quantum Computers

The Quantum Threat to Encryption

RSA, ECC, and Diffie-Hellman: the backbone of internet security — banking, messaging, e-commerce, government communications. Shor's algorithm (1994): a quantum computer can factor large numbers exponentially faster than classical computers. RSA-2048: classical computers would need ~300 trillion years; a sufficiently powerful quantum computer could do it in hours. "Harvest now, decrypt later" (HNDL): adversaries are already collecting encrypted data to decrypt when quantum computers mature. Timeline: cryptographically relevant quantum computers (CRQC) estimated by late 2030s to early 2040s. CNSA 2.0 (NSA, 2022): US government must transition to post-quantum cryptography by 2035. The transition must happen BEFORE quantum computers arrive — a multi-year process for global infrastructure.

NIST Post-Quantum Standards

NIST Post-Quantum Cryptography Standardization (started 2016): global competition to select quantum-resistant algorithms. August 2024: first three standards finalized — FIPS 203 (ML-KEM/CRYSTALS-Kyber), FIPS 204 (ML-DSA/CRYSTALS-Dilithium), FIPS 205 (SLH-DSA/SPHINCS+). CRYSTALS-Kyber (ML-KEM): key encapsulation mechanism based on Module Learning With Errors (MLWE) lattice problem. Key sizes: 800-1,568 bytes (vs. 256 bytes for ECC) — larger but manageable. CRYSTALS-Dilithium (ML-DSA): digital signature algorithm, also lattice-based. SPHINCS+ (SLH-DSA): hash-based signatures — conservative, well-understood security, but larger signatures. FIPS 206 (FALCON): lattice-based signatures with smaller size — standardized in 2025. Ongoing: NIST evaluating additional signature schemes (BIKE, HQC, Classic McEliece) as alternatives.

Lattice-Based Cryptography

Lattice problems: finding short vectors in high-dimensional lattices — believed to be hard for both classical and quantum computers. Learning With Errors (LWE, Regev 2005): adding "noise" to linear equations over integers makes them exponentially hard to solve. Module-LWE: structured variant — better efficiency with believed-equivalent security. Why lattices? Mathematical hardness well-studied (20+ years), efficient implementations, versatile (encryption, signatures, fully homomorphic encryption). Fully Homomorphic Encryption (FHE): compute on encrypted data without decrypting — lattice-based schemes (BFV, CKKS, BGV) are the most practical. Applications of FHE: privacy-preserving ML, secure cloud computing, confidential medical data analysis. Performance: ML-KEM key generation <0.1 ms, encapsulation <0.1 ms on modern CPUs — competitive with RSA. Attacks: no known polynomial-time quantum attack on lattice problems (unlike factoring for RSA).

The Global Transition

US Executive Order (January 2025): federal agencies must inventory cryptographic systems and create transition plans. Signal messenger (September 2023): deployed PQXDH — combining X25519 (classical) with ML-KEM-768 (post-quantum) for hybrid key exchange. Apple iMessage (February 2024): PQ3 protocol with ML-KEM — "Level 3" post-quantum security. Google Chrome: experimental ML-KEM support in TLS 1.3. Cloudflare: post-quantum key agreement enabled by default for all customers. Hybrid approach: combine classical + post-quantum algorithms during transition — security of whichever is stronger. Challenges: legacy systems (IoT devices, embedded systems, SCADA) that can't be easily updated. PKI (Public Key Infrastructure) transition: new certificates, updated protocols (TLS 1.3+), re-signed code. Quantum Key Distribution (QKD): hardware-based quantum-safe key exchange — complementary to post-quantum algorithms. Cost: Booz Allen estimates $7.1 billion for US government transition alone. The largest cryptographic migration in history — "Y2Q" (Years to Quantum).

Try it live

Everything above runs in your browser — open SPH Fluid and change the parameters while it is running. Nothing is installed, nothing is uploaded, the whole model lives in one tab.