Foundations

Cryptography, post-quantum, and why it matters.

A plain-language but technically correct primer for security leaders and practitioners. Three parts: how today's cryptography works, what post-quantum cryptography is, and why your organization needs to act before a quantum computer arrives.

01

Cryptography basics

Cryptography protects three things: confidentiality (only the intended party can read the data), integrity (the data hasn't been altered), and authenticity (you're really talking to who you think you are). Nearly every modern system relies on two very different families of algorithms working together.

Symmetric cryptography — one shared key

The same secret key both encrypts and decrypts. It is fast and used for the bulk of actual data encryption. The workhorse is AES (with key sizes 128 or 256 bits); message integrity comes from MACs such as HMAC, and hashing from the SHA-2 and SHA-3 families. The catch: both parties must already share the secret key.

Asymmetric (public-key) cryptography — a key pair

Each party has a public key (shared freely) and a private key (kept secret). This solves the "how do two strangers agree on a secret over an open network?" problem and enables digital signatures. It underpins:

  • Key exchange / establishment — Diffie-Hellman (DH) and ECDH let two parties derive a shared symmetric key over a public channel.
  • Digital signatures — RSA, ECDSA, and EdDSA prove authenticity and integrity (code signing, certificates, documents).
  • Encryption of small secrets — e.g. RSA encrypting a symmetric session key.
The pattern to remember: public-key crypto is used to establish trust and agree on a key; symmetric crypto (AES) then encrypts the actual traffic. TLS ("the padlock") does exactly this on every HTTPS connection.

Why it's secure today: hard math problems

Public-key security rests on math problems that are easy to compute one way but believed to be infeasible to reverse on classical computers:

AlgorithmHard problem it relies on
RSAInteger factorization — factoring a large number back into its two prime factors
Diffie-Hellman / DSADiscrete logarithm problem
ECDH / ECDSAElliptic-curve discrete logarithm problem

Where cryptography lives in the enterprise

It is everywhere — often invisibly, inside products you don't control:

In transit

TLS/HTTPS, VPNs & IPsec, SSH, Wi-Fi (WPA), email transport, API calls, service mesh.

Identity & trust

PKI & X.509 certificates, code signing, secure boot / firmware signing, SSO tokens, smartcards, TPMs.

At rest

Database TDE, disk/volume encryption, backups, object storage, secrets vaults, HSMs.

Applications

S/MIME & PGP email, blockchain/wallets, DRM, messaging (Signal protocol), payment (EMV, PCI).

Because the same primitives (RSA, ECC, DH) are embedded in all of these, a single algorithm becoming breakable has enormous blast radius — which is exactly the post-quantum problem.

02

PQC 101

Post-Quantum Cryptography (PQC) — also called quantum-resistant or quantum-safe cryptography — is a new generation of algorithms designed to run on today's ordinary computers while resisting attacks from both classical and future quantum computers. It is not quantum key distribution (QKD), which needs special hardware; PQC is just new math you deploy in software.

Why quantum computers break today's public-key crypto

Two quantum algorithms matter, and they matter very differently:

Catastrophic

Shor's algorithm

A large, error-corrected quantum computer running Shor's algorithm can efficiently solve integer factorization and discrete logarithms. That breaks RSA, Diffie-Hellman, ECDH, and ECDSA entirely — the entire public-key layer. This is the core threat.

Manageable

Grover's algorithm

Grover's algorithm gives a quadratic speed-up on brute-force search, effectively halving the security of symmetric keys and hashes. The fix is simply larger sizes: AES-256 stays safe, AES-128 is weakened, and SHA-256/SHA-3 remain fine.

The single most important takeaway: the crisis is public-key cryptography (RSA / ECC / DH). Symmetric encryption and hashing are largely fine — just move to AES-256 and strong hashes. So PQC standardization has focused on replacing key establishment and signatures.

The families of post-quantum math

PQC replaces "factoring is hard" with other problems believed hard even for quantum computers:

FamilyExamplesNotes
Lattice-basedML-KEM (Kyber), ML-DSA (Dilithium), FN-DSA (Falcon)The primary choice — good balance of speed and size. Basis of the first NIST standards.
Hash-basedSLH-DSA (SPHINCS+), LMS, XMSSSignatures only. Very conservative security (relies only on hash functions) but larger/slower — good for long-lived roots & firmware.
Code-basedHQC, Classic McElieceLong-studied. HQC chosen as a backup KEM; McEliece has huge public keys but tiny ciphertexts.
Isogeny-basedSIKE (broken)A cautionary tale: SIKE was a NIST finalist but was broken on a classical computer in 2022 — why diversity of families matters.

The NIST standards you'll actually deploy

In August 2024 NIST finalized the first three post-quantum standards, and selected a backup KEM in March 2025:

FIPS 203

ML-KEM

Module-Lattice Key-Encapsulation Mechanism (from CRYSTALS-Kyber). The default for key exchange — replacing ECDH/RSA key transport. Parameter sets: ML-KEM-512/768/1024.

FIPS 204

ML-DSA

Module-Lattice Digital Signature Algorithm (from CRYSTALS-Dilithium). The default for signatures — replacing RSA/ECDSA. Parameter sets: ML-DSA-44/65/87.

FIPS 205

SLH-DSA

Stateless Hash-based Signatures (from SPHINCS+). A conservative backup signature for high-assurance / long-lived use such as firmware signing.

Also in the pipeline: HQC (a code-based backup KEM selected March 2025, standard expected ~2027) and FN-DSA / FIPS 206 (Falcon, a compact lattice signature, still in draft). Treat these as forthcoming, not yet deployable.

What is a "KEM" and why the new word?
A Key-Encapsulation Mechanism is the post-quantum way to agree on a shared secret. Instead of Diffie-Hellman's "both sides mix keys," one party uses the other's public key to encapsulate a fresh random secret, sends the resulting ciphertext, and the recipient decapsulates it with their private key. Both now share the same symmetric key. ML-KEM is a KEM; it slots into TLS and VPNs where ECDH used to sit.

Practical realities of PQC

  • It runs on today's hardware. No quantum computer or special hardware required to use PQC — it's software.
  • Keys and signatures are bigger. ML-KEM/ML-DSA keys and messages are larger than ECC's. This can stress protocols, packet sizes, buffers, smartcards, and constrained devices — expect testing.
  • Hybrid is the safe first step. "Hybrid" here means combining a classical algorithm (e.g. X25519) with a PQC one (e.g. ML-KEM-768) so you're protected even if one is later found weak. TLS is already deploying X25519MLKEM768.
  • Crypto-agility is the real goal. Build systems so the algorithm can be swapped without re-engineering — because standards will keep evolving.
Note on "hybrid": the word has two meanings. Classic "hybrid encryption" = public-key + symmetric (what TLS always did). In PQC, "hybrid" = classical + post-quantum together. This page means the second unless stated.
03

Why it matters — now

No cryptographically-relevant quantum computer exists yet. So why is every major government and cloud provider telling enterprises to start today? Three reasons.

1 · Harvest Now, Decrypt Later (HNDL)

An adversary doesn't need a quantum computer today to attack you today. They can capture and store your encrypted traffic now — VPN sessions, database backups, TLS flows — and simply wait. When a quantum computer arrives, they decrypt the archive retroactively. This means any data with a long confidentiality lifetime is already at risk right now: health records, financial and legal data, government secrets, intellectual property, biometrics, and long-lived keys.

2 · Q-Day is uncertain — and timelines are compressing

"Q-Day" is the hypothetical day a quantum computer can break RSA-2048. Estimates range widely, but the direction of travel is what matters: authorities and vendors report that credible timelines have been pulled forward from the classic "2035+" figure, and the consistent official message is plan now, don't wait. You cannot schedule a multi-year migration around a threat whose arrival date you don't control.

3 · Mosca's inequality — you may already be late

Cryptographer Michele Mosca framed the risk as a simple inequality. Let:

X
how long your data must stay secret (years)
Y
how long your migration will take (years)
Z
years until a quantum computer can break your crypto

If X + Y > Z, you have a problem: some of your data will still need protecting after the point at which it can be broken. Because you control only Y — the migration — the only lever you have is to start early and shrink it.

Worked example: A bank must keep records secret for 15 years (X). Its cryptographic migration will realistically take 7 years (Y). If a quantum computer is 12 years (Z) away, then 15 + 7 = 22 > 12 — the bank is already 10 years too late for data it protects today. That is the entire argument for starting now.

The compliance clock is also running

Beyond the threat itself, mandates are turning PQC into a hard requirement — see the deadline timeline and the migration guide for detail. In brief:

WhenMilestoneSource
2027New U.S. national-security-system acquisitions must be quantum-resistantNSA CNSA 2.0
2030112-bit algorithms (RSA-2048, ECC P-256) deprecated for new federal systemsNIST IR 8547 (draft)
2035Quantum-vulnerable algorithms disallowed; broad migration targetNIST IR 8547 / NSM-10 / EU roadmap
AnnualU.S. federal agencies must maintain a cryptographic inventoryOMB M-23-02

Even organizations outside these mandates inherit them through the supply chain: customers, partners, and procurement gates increasingly push PQC requirements downstream.

Why the migration is slow — so start now

  • Crypto is embedded everywhere, often invisibly inside third-party products, libraries, appliances, and certificates you don't fully control.
  • Deep dependencies — PKI hierarchies, hardware roots of trust, and protocol negotiation all have to move together, and larger PQC keys break assumptions.
  • Hardware limits — HSMs, smartcards, TPMs, and embedded/OT devices may need firmware updates or physical replacement; some legacy gear simply can't be upgraded.
  • Decades of tech debt — hard-coded algorithms and unmanaged keys make this a multi-year program, not a patch.

Ready to plan the migration?

Move from understanding to action with a comprehensive, NIST-aligned migration process — and discovery methods for the hardest first step: finding where your cryptography actually lives.