The field · cryptography

Post-quantum cryptography

The first place quantum computing has a deadline attached — and the one section here you can act on this quarter. Pair it with the arcade's BB84 game, which shows why no-cloning makes key exchange detectably secure, and with pqc-scan, which inventories the vulnerable algorithms in a codebase.

  • Verified — published result
  • Vendor-reported result
  • Projection — roadmap target
  • Opinion — named, dated
  • Estimate — with caveats
  • Contested — disputed in the record
  • Preprint — not yet peer-reviewed

The standards

NIST finalized FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), FIPS 205 (SLH-DSA)

Verified — published result

On 13 August 2024 NIST issued its first three post-quantum standards. ML-KEM (key encapsulation) derives from CRYSTALS-Kyber; ML-DSA (signatures) from CRYSTALS-Dilithium; SLH-DSA (stateless hash-based signatures) from SPHINCS+. They are the algorithms the rest of this section assumes you will migrate to.

HQC selected as a fifth, non-lattice backup algorithm

Verified — published result

On 11 March 2025 NIST selected HQC, a code-based key-encapsulation scheme, as a backup to ML-KEM — deliberately not lattice-based, so a future break of lattice assumptions would not take down both. ML-KEM remains the primary recommendation.

NIST IR 8547: RSA/ECC at 112-bit strength deprecated after 2030, all quantum-vulnerable public-key disallowed after 2035

Verified — published result

NIST's transition roadmap (initial public draft, November 2024) sets two dates: algorithms providing ~112 bits of security — RSA-2048, ECDSA/ECDH on P-256 — are deprecated after 2030 (no new use), and all quantum-vulnerable public-key algorithms are disallowed after 2035. The window between is the intended migration runway. Note: the document is an initial public draft; the dates are NIST's stated plan.

The threat model, plainly

Mosca's inequality: if X + Y > Z, you are already late

Verified — published result

Michele Mosca's framing (IEEE Security & Privacy, 2018): let X be how long your data must stay secret, Y how long your migration to quantum-safe cryptography takes, and Z how long until a cryptographically relevant quantum computer exists. If X + Y > Z, some data you protect today will be exposed. Because Z is uncertain and X can be decades for medical, legal or state secrets, the rational move is to shrink Y now.

'Harvest now, decrypt later' — why the deadline is before the computer exists

Verified — published result

An adversary can record encrypted traffic today and decrypt it when a capable machine arrives. Key exchange (RSA, ECDH) is the exposure: anything whose confidentiality must outlast the arrival of such a machine is at risk the moment it crosses the wire under classical public-key protection. This is the threat model NIST's 2030/2035 dates are built around, and why migration of key exchange is prioritized over signatures.

AES and hash functions are not broken the same way

Verified — published result

Only public-key cryptography is exposed to Shor's algorithm. Symmetric ciphers and hashes face at most Grover's quadratic speedup, which must run serially to realize; NIST's own FAQ states it is 'quite likely that Grover's algorithm will provide little or no advantage in attacking AES, and AES 128 will remain secure' — NIST even uses AES-128 as the security baseline for its post-quantum categories. Migration effort belongs on key exchange and signatures.

How many qubits to break RSA-2048 — a falling number

Each point is a named resource estimate. The qubits are noisy physical qubits under each paper's stated assumptions; the papers differ in assumptions, so compare direction, not decimals.

estimatephysical qubitsruntimesource
Fowler, Mariantoni, Martinis & Cleland (2012)≈ 10⁹ physical qubits≈ 1 day (order of magnitude)Phys. Rev. A 86, 032324 (2012)
Gidney & Ekerå (2019 preprint, Quantum 2021)20 million noisy physical qubits8 hoursQuantum 5, 433 (2021)
Gidney (2025)fewer than 1 million noisy physical qubitsunder one weekGidney, arXiv:2505.15917

Fowler, Mariantoni, Martinis & Cleland (2012)

Estimate — with caveats

The foundational surface-code resource analysis. Its order-of-magnitude figure of roughly a billion physical qubits became the baseline that framed the urgency of NIST's 2016 call for post-quantum algorithms.

Gidney & Ekerå (2019 preprint, Quantum 2021)

Verified — published result

Assuming a planar superconducting grid, 10⁻³ physical error rate, 1 µs surface-code cycle: ~20 million physical qubits, ~2.7 billion Toffoli gates, ~8 hours. A roughly 50× reduction from the 2012 baseline.

Gidney (2025)

Verified — published result

The lowest published estimate as of this page's check date: a 20× reduction in qubits from the 2021 figure, at the cost of a longer runtime, using approximate residue arithmetic and yoked surface codes. A preprint; the direction of travel — down, fast — is the point.

What to do, in order

  1. Inventory every use of RSA, ECDSA, ECDH and DH in your systems (a crypto bill of materials).
  2. Migrate key exchange first — that is where harvest-now-decrypt-later bites — to ML-KEM, hybrid with classical during transition.
  3. Then signatures (ML-DSA; SLH-DSA where hash-based conservatism is wanted).
  4. Leave AES-128/256 and SHA-2/SHA-3 alone; they are not the problem.
  5. Plan against NIST's dates: nothing new on 112-bit RSA/ECC after 2030; nothing at all after 2035.

See also