What Is Post-Quantum Cryptography?
Post-quantum cryptography (PQC) is a new generation of public-key algorithms designed to resist attacks from both classical and quantum computers. Critically, PQC runs on the ordinary computers, servers, and phones we already use — it is software, not exotic quantum hardware.
A working definition
Post-quantum cryptography — sometimes called quantum-resistant or quantum-safe cryptography — refers to cryptographic algorithms whose hardness assumptions are believed to hold even against a large, fault-tolerant quantum computer. The threat is concrete: a sufficiently large, fault-tolerant quantum computer running Peter Shor's 1994 algorithm would break the math behind today's public-key crypto (RSA, finite-field Diffie-Hellman, and elliptic-curve schemes such as ECDH/ECDSA). PQC replaces those primitives with alternatives built on different mathematical problems — lattices, hash functions, error-correcting codes, and more — for which no efficient quantum attack is known.
PQC is classical software, not quantum technology
A common misconception is that defending against quantum computers requires quantum computers. It does not. PQC algorithms are conventional code: they execute on the same x86 and ARM processors that run your web servers and smartphones today. You deploy PQC the same way you deploy any cryptographic upgrade — through libraries, protocol updates, and certificate changes.
How PQC differs from quantum key distribution
Quantum key distribution (QKD) is a different thing entirely. QKD uses the physics of photons to establish a shared secret over a dedicated optical link, with security rooted in quantum mechanics rather than computational hardness. It requires special hardware, has severe distance limits, and cannot be deployed over the existing internet or stored data. PQC, by contrast, is a drop-in mathematical replacement that works everywhere classical crypto works today.
| Property | Post-Quantum Cryptography | Quantum Key Distribution |
|---|---|---|
| Runs on | Classical computers | Specialized quantum/optical hardware |
| Security basis | Hard math problems | Laws of physics |
| Deployment | Software, internet-wide | Point-to-point fiber links |
| Protects stored data | Yes | No |
The two primitives PQC must replace
Public-key cryptography does two jobs, and PQC provides a quantum-safe answer for each.
1. Key establishment (KEMs)
Before two parties can talk securely, they must agree on a shared symmetric key. Today this is done with Diffie-Hellman or RSA key transport. The PQC equivalent is a key encapsulation mechanism (KEM): one side encapsulates a random secret to the other's public key, producing a ciphertext that only the holder of the private key can decapsulate. NIST's standardized KEM is ML-KEM (FIPS 203). See Key Encapsulation Mechanisms.
2. Digital signatures
Signatures prove authenticity and integrity — that a message, a software update, or a TLS certificate genuinely comes from its claimed source. RSA and ECDSA signatures are quantum-vulnerable, so they must be replaced by quantum-safe schemes such as ML-DSA (FIPS 204) and SLH-DSA (FIPS 205). See Digital Signatures.
Why symmetric cryptography is largely fine
Quantum computing does not break everything. Symmetric ciphers and hash functions face only Grover's algorithm, which provides a mere quadratic speedup — it effectively halves the security level rather than collapsing it. In common engineering estimates, increasing symmetric key length offsets the quadratic speedup from Grover; the actual security margin still depends on the algorithm, implementation, and resource estimates. AES-256 and SHA-384 remain secure against a quantum adversary; you generally do not need to replace them, only ensure you are using sufficiently large parameters. The crisis is confined to public-key cryptography, which is exactly what PQC targets. To understand the threat in detail, see The Quantum Threat.
The families of PQC
Because no single mathematical problem is universally trusted, NIST and the wider community pursue several independent algorithm families. Lattice-based schemes lead the standards (efficient and versatile), while hash-based signatures offer the most conservative security, and code-based KEMs provide a long-studied alternative. Diversity is deliberate: if one family is weakened, others stand ready.
The Quantum Threat →
What Shor and Grover actually break.
Algorithm Families →
Lattice, hash, code-based, and more.
KEMs →
How quantum-safe key establishment works.
Signatures →
Quantum-safe authenticity and integrity.
Standards & references
- NIST Post-Quantum Cryptography project — the program that ran the PQC standardization competition.
- FIPS 203 (ML-KEM) — the standardized key encapsulation mechanism.
- FIPS 204 (ML-DSA) — the lattice-based digital signature standard.
- FIPS 205 (SLH-DSA) — the hash-based digital signature standard.
- ETSI Quantum-Safe Cryptography — standards and industry guidance on the quantum-safe transition.
- Resources — full standards register
什么是后量子密码
后量子密码 PQC 是一类全新的公钥算法,设计目标是同时抵御经典计算机与量子计算机的攻击。关键在于,PQC 运行在我们日常使用的普通计算机、服务器和手机上,它是软件,而非特殊的量子硬件。
一个可操作的定义
后量子密码,也称抗量子密码或量子安全密码,指的是即便面对大规模容错量子计算机、其困难性假设依然成立的密码算法。威胁是具体的:一台足够大、容错的量子计算机运行 Shor 在 1994 年提出的算法将能攻破当今公钥密码背后的数学难题,包括 RSA、有限域 Diffie-Hellman 以及椭圆曲线方案(如 ECDH 与 ECDSA)。PQC 用基于不同数学问题的方案替换这些原语,这些问题包括格、哈希函数、纠错码等,目前尚无针对它们的高效量子攻击。
PQC 是经典软件而非量子技术
一个常见误解是,防御量子计算机必须依赖量子计算机,事实并非如此。PQC 算法就是普通代码,运行在与今天承载 Web 服务和智能手机相同的 x86 和 ARM 处理器上。部署 PQC 的方式与部署任何密码升级别无二致,通过库、协议更新和证书替换即可完成。
PQC 与量子密钥分发的区别
量子密钥分发 QKD 是完全不同的技术。QKD 利用光子的物理特性在专用光链路上建立共享密钥,其安全性根植于量子力学而非计算困难性。它需要专门硬件,距离受限严重,既无法在现有互联网上部署,也无法保护已存储的数据。相比之下,PQC 是一种可直接替换的数学方案,在所有经典密码适用的场景中同样适用。
| 特性 | 后量子密码 | 量子密钥分发 |
|---|---|---|
| 运行平台 | 经典计算机 | 专用量子或光学硬件 |
| 安全基础 | 数学难题 | 物理定律 |
| 部署方式 | 软件 覆盖全互联网 | 点对点光纤链路 |
| 保护存储数据 | 可以 | 不可以 |
PQC 必须替换的两类原语
公钥密码承担两项工作,PQC 为每一项都提供了量子安全的答案。
1 密钥建立 KEM
两方在安全通信前必须先协商出一个共享对称密钥,今天这通过 Diffie-Hellman 或 RSA 密钥传输完成。其 PQC 对应物是密钥封装机制 KEM:一方用对方的公钥封装一个随机秘密,生成只有私钥持有者才能解封装的密文。NIST 标准化的 KEM 是 ML-KEM(FIPS 203),参见 密钥封装机制。
2 数字签名
签名用于证明真实性与完整性,即一条消息、一个软件更新或一张 TLS 证书确实来自其声称的来源。RSA 和 ECDSA 签名易受量子攻击,因此必须替换为量子安全方案,例如 ML-DSA(FIPS 204)和 SLH-DSA(FIPS 205),参见 数字签名。
为何对称密码基本无虞
量子计算并非攻破一切。对称加密和哈希函数只面对 Grover 算法,而它仅提供平方级加速,实际效果是将安全强度减半,而非彻底瓦解。在常见工程估算中,提高对称密钥长度可抵消 Grover 带来的平方级加速;实际安全裕度仍需结合算法、实现与资源估计判断。AES-256 和 SHA-384 在量子对手面前依然安全,通常无需替换,只需确保参数足够大。危机仅局限于公钥密码,而这正是 PQC 所瞄准的目标。欲了解威胁细节,参见 量子威胁。
PQC 的算法家族
由于没有任何单一数学难题被普遍信任,NIST 与整个社区同时推进多个独立的 算法家族。基于格的方案领跑标准,高效且通用;基于哈希的签名提供最为保守的安全性;基于编码的 KEM 则给出一个经过长期研究的备选。多样性是有意为之,一旦某个家族被削弱,其他家族可随时顶上。
标准与参考
- NIST 后量子密码项目 — 主持 PQC 标准化遴选的计划。
- FIPS 203 ML-KEM — 标准化的密钥封装机制。
- FIPS 204 ML-DSA — 基于格的数字签名标准。
- FIPS 205 SLH-DSA — 基于哈希的数字签名标准。
- ETSI 量子安全密码 — 关于量子安全迁移的标准与产业指南。
- 资源链接 — 完整标准登记册