NIST's approved quantum-resistant algorithms — one by one. Interactive infographics for India's quantum-ready future.
// WHY IT MATTERS
Current RSA & ECC encryption will be broken once cryptographically relevant quantum computers exist. The race is on.
Peter Shor's 1994 quantum algorithm can factor large integers exponentially faster than any classical method — rendering RSA and ECC completely insecure once quantum hardware matures.
Nation-state actors are already harvesting today's encrypted data to decrypt it after quantum computers arrive. Your data transmitted in 2024 could be read by 2030.
Healthcare IoMT devices, financial systems, defense communications, and power grids all rely on RSA/ECC. A quantum breach means catastrophic simultaneous failure across sectors.
Grover's algorithm provides a quadratic speedup for symmetric key search, effectively halving security levels. AES-128 becomes ~AES-64 against a quantum computer — still breakable.
// NIST FIPS STANDARDS
Tap each algorithm to explore its mathematics, use cases, key sizes, and performance characteristics.
Module-Lattice-Based Key Encapsulation Mechanism. The primary standard for general encryption — replacing RSA and Diffie-Hellman for secure key exchange. Used in TLS handshakes, VPNs, and secure messaging. Google, Apple, and Cloudflare have already begun deployment.
Module-LWE: solve As + e ≡ b (mod q)Module-Lattice-Based Digital Signature Algorithm. The primary standard for digital signatures — protecting code signing, document signing, certificate authorities, and identity authentication against quantum forgery attacks.
Module-SIS: find short s, e: As = t (mod q)Stateless Hash-Based Digital Signature Algorithm. The backup signature standard — based entirely on hash functions, not lattices. Provides critical diversity: if lattice-based schemes are ever broken, SLH-DSA remains unaffected, making it the long-term insurance policy.
One-Way Hash: H(x) → y, infeasible to find xFFT-over-NTRU-Lattice-Based Digital Signature Algorithm. The compact alternative signature — provides the smallest signature sizes among all selected algorithms. Ideal for bandwidth-constrained environments like DNSSEC, IoT devices, and embedded hardware.
NTRU: fh = g (mod q) in cyclotomic ringHamming Quasi-Cyclic — a code-based key encapsulation mechanism selected in March 2025 as a backup KEM to ML-KEM. Provides algorithmic diversity through error-correcting code theory rather than lattice math — critical if lattice-based schemes face unexpected weaknesses.
QC-SD: Syndrome Decoding in quasi-cyclic codes// SIDE BY SIDE
Performance, key sizes, and trade-offs across all NIST-approved PQC standards at a glance.
| Algorithm | FIPS | Type | Math Basis | Key / Sig Size | Speed | Status |
|---|---|---|---|---|---|---|
| 🔑 ML-KEM | 203 | Key Encap. | Module-LWE Lattice | Finalized | ||
| ✍️ ML-DSA | 204 | Signature | Module-SIS Lattice | Finalized | ||
| 🌲 SLH-DSA | 205 | Signature | Hash Functions | Finalized | ||
| 🦅 FN-DSA | 206 | Signature | NTRU Lattice | Draft | ||
| 📡 HQC | TBD | Key Encap. | Error-Correcting Codes | Standardizing |
// INDIAN QUANTUM RESEARCH ORGANISATION
Translating NIST standards into teachable modules. Protecting India's digital infrastructure — from healthcare IoMT to defense communications.