Post-Quantum Cryptography
Preparing today so tomorrow's quantum computers can't crack our secrets.
Shor's Algorithm & Period r & Immediate Urgency
Why public-key cryptography must evolve before cryptanalytically relevant quantum computers mature.
For over four decades, modern digital security has rested on a
single mathematical assumption: that multiplying two large secret
primes (p×q = N) is trivial, but reversing the process
is practically impossible. Every secure web connection (HTTPS),
banking transaction, and digital signature in the world relies on
asymmetric cryptography built on this foundation.
However, quantum computers operating on quantum mechanics fundamentally change the rules. Using quantum superposition and wave interference, Peter Shor proved in 1994 that a quantum machine can discover the hidden period of modular powers, collapsing the classical 3.4-billion-year wall of RSA-2048 into roughly 8 hours of continuous quantum calculation.
The Digital Freezer: Harvest Now, Decrypt Later
Adversaries and intelligence agencies are not waiting for quantum supercomputers to arrive before taking action. They are actively recording and archiving encrypted internet traffic today, stashing petabytes of ciphertext away in digital freezers.
Their strategy is known as "Harvest Now, Decrypt Later" (HNDL): intercept and freeze encrypted communications, diplomatic cables, proprietary intellectual property, and medical records today. When cryptanalytically relevant quantum computers mature, they can thaw and decrypt everything. Migrating to post-quantum cryptography today is the only way to protect data that requires long-term confidentiality.
What is Post-Quantum Cryptography?
Everyday hardware running revolutionary mathematics designed to withstand quantum physics.
A common misconception is that Post-Quantum Cryptography (PQC) requires physical quantum computers. In reality, can post-quantum algorithms run directly on your smartphone or laptop.
The difference lies entirely in the underlying mathematics: replacing algebraic problems that quantum computers solve effortlessly with mathematical problems that both classical and quantum machines find practically impossible to unravel.
Why Asymmetric Shatters While Symmetric Holds Strong
Quantum computers do not accelerate all mathematical operations equally. Their capability depends entirely on whether a cipher contains hidden periodic structure:
1. Algebraic Period-Finding: Total Collapse
Algorithms like RSA, Diffie-Hellman, and Elliptic Curves rely
on cyclic group arithmetic. Shor's algorithm uses quantum wave
interference to discover these periods in hours.
The Solution: Making RSA keys longer does not stop
the attack. Public-key encryption requires brand-new mathematical
foundations (such as multi-dimensional lattices and hash trees).
2. Quadratic Search: Solved by Doubling Keys
Symmetric ciphers (like AES) have no mathematical period; they
are chaotic pseudorandom shuffles. Grover's algorithm provides
a quadratic speedup for searching unstructured keys.
The Solution: Grover effectively halves key length
(AES-128 drops to 64 bits of security). Simply upgrading to AES-256 preserves 128 bits of post-quantum security, demanding billions
of years to crack.
Finalised Global PQC Standards
The first generation of official post-quantum standards released by NIST in August 2024.
Following an eight-year global competition evaluating dozens of mathematical candidate algorithms, the National Institute of Standards and Technology (NIST) finalised the first official production standards for Post-Quantum Cryptography:
Curriculum Roadmap & Topic Deep Dives
Dive into the dedicated mathematical and interactive lessons across the post-quantum curriculum.
Post-Quantum Cryptography spans several distinct branches of mathematics and computer science. Explore the dedicated topic lessons below to dive deeper into each domain:
Shor's Algorithm & Period r
Discover how Peter Shor's 1994 algorithm translates prime factorisation into order-finding, uses the Quantum Fourier Transform to isolate resonant frequencies, and breaks RSA-2048 in hours.
Grover's Algorithm & AES-256
Examine Lov Grover's quantum search algorithm, why it delivers a quadratic rather than exponential speedup, and how doubling symmetric keys to 256 bits keeps encryption secure against quantum brute force.
Lattice-Based Cryptography
Step into the multi-dimensional shortbread warehouse. Learn how the Learning With Errors (LWE) problem and high-dimensional vector spaces power ML-KEM and ML-DSA.
Stateless Hash-Based Signatures
Explore Lamport one-time icing stamps, Merkle authentication trees, and the stateless hyper-tree structures that protect SLH-DSA without relying on unproven algebraic hardness.
