Post-quantum: what if the quantum computer arrives
Every few months it's in the news again: the quantum computer is coming and then all encryption is worthless. That isn't right. A quantum computer isn't a magic wand that opens every lock — it's very good at one particular kind of sum, and as it happens that's exactly the sum half of this book rests on. The other half it doesn't touch. This chapter says precisely which half is which, and what's being done about it.
Words you might need
- Quantum computer
- A machine that doesn't calculate with bits (0 or 1) but with qubits, which can sit in an in-between state. That lets it do a few very specific sums much faster than an ordinary computer. Not all sums. A few.
- Shor's algorithm
- Peter Shor's recipe from 1994 that lets a quantum computer work out which prime numbers a big number is made of — and also the discrete logarithm from chapter 5. Precisely those two.
- Grover's algorithm
- Lov Grover's recipe from 1996 with which a quantum computer searches faster through a mountain of possibilities. Faster, not instantly: it needs the square root of the number of attempts instead of the number itself.
- Post-quantum (PQC)
- Encryption that runs on an ordinary computer but that a quantum computer can't break, because it rests on a different kind of sum. Not to be confused with quantum encryption, which is something else entirely and needs special equipment.
- Lattice
- A regular pattern of points, like the corners of an endless sheet of squared paper — but then in hundreds of directions at once. The new algorithms do their sums inside one. More about that in the box at the bottom.
What breaks and what stays
Shor's algorithm can see through one kind of hiding place: a sum with a hidden regularity in it, something that repeats every so many steps. Splitting a number into prime factors has that regularity, and so does the discrete logarithm — that clock arithmetic from chapter 5 literally runs in circles. A quantum computer can measure how long such a circuit is, and out of that one length the answer rolls.
That's the bad news right there, because everything that works with two keys stands on it:
| What | Now | With a quantum computer | What you do about it |
|---|---|---|---|
| RSA (chapter 6) | safe because nobody can factorise big numbers | broken — Shor does factorise them | replace with a post-quantum algorithm |
| Diffie–Hellman (chapter 5) | safe because the discrete logarithm has no way back | broken — Shor finds that way back | replace |
| Elliptic curves (chapter 6.2) | safe for the same reason, but with shorter keys | broken — and even slightly more easily than RSA, because the keys are smaller | replace |
| AES (chapter 4) | safe because you have to try every key | stays — Grover only halves the strength | use AES-256 instead of AES-128 |
| Hash functions (chapter 2) | safe because you can't calculate back | stays — here too it's only Grover | take a long hash, SHA-256 or more |
Those bottom two rows deserve an explanation, because "halves the strength" sounds more dramatic than it is. An AES key of 256 bits has 2256 possibilities — a number with 78 digits. Grover only has to try the square root of that: 2128, a number with 39 digits. That's unspeakably much less, and still unspeakably much too much. So you don't replace AES, you just take the long version. That's the whole measure.
The machine doesn't exist yet. The quantum computers running today have too few and too unstable qubits to crack a real RSA key; the biggest numbers ever factorised with one you can also do in your head. Nobody knows whether it'll work in ten years or in forty, or not at all. But the next section explains why that doesn't mean you can wait.
Store now, read later
Someone who catches your encrypted traffic today can't read it. What they can do is keep it. Hard disks are cheap, and in twenty years that machine may well exist. Then they fetch the box down from the attic and read everything you sent in 2026 after all. That attack has a name: harvest now, decrypt later — you collect the harvest while it's still locked and wait for the key to arrive. There's nothing futuristic about it; anyone can do the storing part today.
Whether that matters depends entirely on how long your secret has to stay secret. The message in which you arrange to meet at six is worth nothing tomorrow — if someone reads it in 2046, you have no problem. A medical file, an address that has to stay hidden, a company's plans, a state secret: those still have to hold up in 2046. For that sort of data the quantum computer isn't a problem for later but one for now.
What's ready
The American standards institute NIST announced a competition in 2016: who has encryption that can handle a quantum computer? Eight years, dozens of entries and quite a few fallen candidates later, the first three standards came out on 13 August 2024.
| Standard | Name | Based on | What for |
|---|---|---|---|
| FIPS 203 | ML-KEM | CRYSTALS-Kyber | agreeing on a key — the replacement for Diffie–Hellman |
| FIPS 204 | ML-DSA | CRYSTALS-Dilithium | signatures — the replacement for RSA and the curves |
| FIPS 205 | SLH-DSA | SPHINCS+ | signatures, but on completely different maths |
That last one is there on purpose. ML-KEM and ML-DSA both rest on lattices; if a hole is ever found in those, they fall over together. SLH-DSA uses only hash functions — the same building block from chapter 2, which we've known for thirty years and which the quantum computer can't break. Slower and with much bigger signatures, but it's a spare wheel that was made in a different way.
For the same reason, on 11 March 2025 NIST picked a second way of agreeing on a key: HQC, which doesn't rest on lattices but on error-correcting codes — the maths that makes sure a scratch on a CD doesn't ruin the music. HQC takes more computation than ML-KEM and so isn't a replacement but a way out in case lattices disappoint. The standard itself isn't there yet: NIST is aiming for 2027. A fourth signature standard, FIPS 206 (FN-DSA, from the entry Falcon), is still in the making.
Hybrid: both at once
There's a fair problem with those new algorithms: they're young. RSA has existed since 1977 and the discrete logarithm since 1976, and all that time everyone who knows anything about it has tried to break them. Lattices don't have that half century behind them. The chance that another mistake will be found in them is small but not zero — and in 2022 one of the competition finalists (SIKE) was cracked over a single weekend on an ordinary laptop, which shows exactly how that goes.
That's why nobody is making the switch in one go. The solution is called hybrid, and it works the way the name says:
- You do the old key exchange on an elliptic curve. You get secret A.
- Alongside it you do the new one with ML-KEM. You get secret B.
- You throw A and B together through a hash function. What comes out is the key you actually use.
An attacker now has to break both. If there turns out to be a hole in the lattices, the curve stops them; if the quantum computer arrives, ML-KEM stops them. You pay a few extra bytes for it in every connection, and that's it. Don't confuse this with the hybrid from chapter 7.3: there you combine an asymmetric with a symmetric lock because they do different jobs, here you put two key exchanges side by side because you don't trust either one on its own.
It's already running — with you too
This isn't a plan for later. The hybrid key exchange is in the browser you're
reading this with. It's called X25519MLKEM768: X25519 is the
elliptic curve, ML-KEM-768 the new half, and the padlock from
chapter 7.4 uses them without you having to
do anything for it.
| Where | Since |
|---|---|
| Chrome | version 131, November 2024 — and for a year before that with a forerunner based on Kyber |
| Firefox | version 132, end of 2024 |
| Safari, iOS and macOS | version 26, autumn 2025 |
And it really is being used. Cloudflare, which handles a large share of the world's web traffic, reported in 2026 that more than two thirds of the browser traffic to their network is already protected with a post-quantum key exchange. That's no longer a test setup; that's become the normal route while nobody noticed.
What hasn't switched over yet are the signatures. The certificates a website uses to prove who it is are still almost everywhere on RSA or on a curve. That's less urgent — a signature you forge today after keeping it for twenty years convinces nobody any more — but it is a far bigger move, because every certificate in the world has to come along.
This is the only chapter without a button. The demos on this site all run on WebCrypto, the encryption your browser lends out to JavaScript — and for a long time it didn't know these algorithms. That's just starting to change: Chrome has been offering ML-KEM and ML-DSA in it since the summer of 2026 and Firefox switches them on in version 157. But it isn't everywhere yet, and imitating something in plain JavaScript would show you a toy version pretending to be the real thing. Better a chapter without a button.
This is maths: the shortest vector in a lattice
Draw a sheet of squared paper and put a point on every corner. Now pick two random arrows from the origin, and make all the points you can reach by laying those two arrows end to end a whole number of times, forwards or backwards. What you get is again a regular pattern of points, only pulled askew. That's called a lattice.
The question is simple: which point lies closest to the origin, apart from the origin itself? On a sheet of paper you can point at it. But the lattices of ML-KEM don't sit in two directions but in hundreds, and then nobody can point at it any more — not even a quantum computer, because there's no circuit in it to measure. There's no hidden regularity, and that's exactly why Shor's algorithm can do nothing with it. That field is called the geometry of numbers: doing geometry on points with whole number coordinates. It's existed since the end of the nineteenth century, it was pure maths with no application for a hundred years, and now the padlock in your browser hangs off it.