-1.png)
From Algebra to Noise: Why Post-Quantum Cryptography Looks Different
OpenZeppelin Security's technical explainer on why post-quantum cryptography looks so different from classical crypto: Shor's algorithm exploits the abelian hidden-subgroup structure underlying RSA, Diffie-Hellman, ECDSA, EdDSA and pairing-based schemes, while Grover's algorithm only halves the effective security of hashes and symmetric keys (256-bit hashes stay at a comfortable 128-bit level). It then walks through NIST's finalized lattice/hash-based PQC standards — ML-KEM (Kyber) for key establishment, ML-DSA (Dilithium) for general signatures, SLH-DSA (SPHINCS+) as a conservative hash-based backup, plus future Falcon/FN-DSA and code-based HQC — mapping each to blockchain use cases and covering real deployment (Starknet's Falcon-512 Cairo account contracts), Ethereum account-abstraction/hybrid-signature migration paths, Bitcoin's UTXO/consensus constraints, Ethereum's LeanSig consensus-signature research, and a concrete institutional crypto-asset-inventory and PQC audit checklist.
What it is
OpenZeppelin Security's deep-dive on post-quantum cryptography for tokenized finance (dated Sept 14, 2026), aimed at custody/treasury/governance leads. The summary covers the Shor/Grover/NIST conceptual arc; what it omits is the concrete engineering cost figures and the operational playbook — which are the parts an engineer deciding whether to act actually needs.
The numbers that drive the decision
The migration is not free, and the page quantifies why:
- Signatures: raw secp256k1 ECDSA is tens of bytes; ML-DSA (Dilithium) is measured in kilobytes; SLH-DSA (SPHINCS+) reaches tens of kilobytes depending on parameters. Falcon/FN-DSA is the compact option once standardized.
- Public keys: ML-DSA public keys are ~1.3 KB versus 33 bytes for compressed secp256k1 — significant for account-abstraction wallets that store keys on-chain.
- Verification: lattice verification is computationally heavier than ECDSA, compounding already-expensive on-chain gas costs.
NIST finalized the standards in August 2024: FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), FIPS 205 (SLH-DSA); Falcon (FN-DSA) and HQC selected for future standardization.
The core threat framing
"Expose-now, forge-later" — the on-chain analogue of harvest-now-decrypt-later. Once an authority-bearing public key is permanently on-chain, a future CRQC may recover the private key and forge authorizations unless assets have already migrated. Already-exposed EOAs and forgotten UTXOs cannot be retrofitted — they can only be moved before Q-Day. Base-layer schemes (secp256k1 on both chains) are fixed by consensus, so no institution can unilaterally fix them; this is coordination-bound, systemic risk.
What to do
The page gives a concrete 7-step institutional playbook to start in 2026:
- Cryptographic asset inventory — locate all ECDSA/EdDSA/RSA/BLS use, key exchange, TLS/SSH certs, pairing-based crypto, contract signature verification, off-chain approval keys.
- Classify public-key exposure per wallet/key.
- Identify authority concentration — keys controlling treasuries, bridges, mints, burns, pauses, upgrades, governance, validators, oracles.
- Introduce crypto-agility — abstract signature verification, versioned address formats, upgradeable wallet modules.
- Test hybrid modes. Signatures accept iff both pass:
Accept ⇔ Verify_classical = 1 and Verify_PQ = 1. Key establishment:K = H(K_classical ‖ K_PQ). - Audit PQC implementations by scheme: lattice → side-channel, randomness quality, invalid-input/rejection-sampling; hash-based → domain separation, parameter selection, signature-size budgeting; Falcon → Gaussian-sampler correctness, constant-time, side-channel leakage.
- Prepare governance/comms — legal, regulatory disclosure, custody agreements, insurance, incident response.
Tool-to-use-case mapping: ML-KEM (+ HQC for diversity) for key establishment; ML-DSA for general signatures; SLH-DSA for trust anchors/emergency keys; Falcon/FN-DSA where calldata is scarce.
Caveats
The page is explicit that its own reassurances are bounded: LWE is not "proven secure" — its worst-case-to-average-case reduction to GapSVP/SIVP is evidence of robustness, not proof, and cryptographic parameters sit in the approximation regime where lattice problems are not believed NP-hard. Grover's 2^(n/2) is a query bound that overstates real cost (barely parallelizes — √P not P; sequential depth prohibitive), so hash sizing is an engineering tradeoff, not a solved problem. LeanSig is early-stage research, not production-ready. Hybrid modes add size, verification cost, and new failure modes.
Organisations named here
- Cairo
- CRYSTALS-Dilithium
- CRYSTALS-Kyber
- FIPS 203
- FIPS 204
- Lean Ethereum
- Starknet
Technologies named here
- Bitcoin
- ML-KEM
- Ethereum
- ML-DSA
- SLH-DSA
- secp256k1
- Falcon / FN-DSA
- Externally Owned Accounts / UTXOs
- HQC
- Starknet Cairo account contracts
- LeanSig
- FALCON
- NIST
- SPHINCS+
- FIPS 205
Techniques named here
- Shor's algorithm
- Grover's algorithm
- Learning With Errors
- Hybrid signatures / hybrid key establishment
Related in Blockchain

THORChain Exploit Report #2 — GG20 root-cause disclosure

Black Thursday revisited: MakerDAO keeper exploited for $500K
.jpg)