QianHeng乾珩 PQC Docs Hub量子文档 ✦ Ask AI✦ 问问文档 ⚐ Scan⚐ 扫一扫

Frequently Asked Questions

Plain-language answers to the questions teams ask most often when starting a post-quantum migration. For deeper treatment, follow the cross-links in each answer.

Threat and timing

Is my data at risk right now?

Possibly. No public quantum computer can break RSA or ECC today, but the Harvest Now, Decrypt Later (HNDL) threat is real: an adversary can record your encrypted traffic now and decrypt it once a cryptographically relevant quantum computer (CRQC) exists. If your data must stay confidential for 10+ years, treat it as already at risk and prioritize it for migration.

When will RSA be broken?

Nobody knows the exact date. Most migration guidance does not rely on a precise prediction but uses Mosca's inequality: it weighs the relationship between how long your data must stay confidential, the time needed to migrate, and when a CRQC might appear to decide whether to act now. The honest planning answer comes from Mosca's inequality: if the time your data must stay secret, plus the time to migrate, exceeds the time until a CRQC arrives, you are already late. Plan against the inequality, not a calendar date.

Do I need to do anything if a quantum computer doesn't exist yet?

Yes — migration takes years, and harvest-now-decrypt-later means waiting forfeits the confidentiality of today's data. Start inventory and crypto-agility work now.

The technology

Do I need a quantum computer to run PQC?

No. Post-quantum algorithms run on ordinary classical computers — laptops, servers, phones, smartcards. They are simply new math problems believed to resist quantum attack. The "quantum" refers to the threat they defend against, not the hardware they run on.

What is the difference between QKD and PQC?

QKD (quantum key distribution) uses quantum physics over special hardware and fiber/optical links to exchange keys; it has range and infrastructure limits and does not provide authentication on its own. PQC is software/math that runs everywhere on existing hardware and replaces today's public-key algorithms directly. NIST, NSA, and most standards bodies recommend PQC as the general solution; QKD typically suits specific scenarios with dedicated links and high-assurance needs, and cannot replace authentication or general protocol-stack upgrades. They are not interchangeable.

Is symmetric cryptography safe from quantum computers?

Largely yes. Grover's algorithm gives only a quadratic speedup against symmetric ciphers and hashes, so the fix is to use larger sizes: AES-256 instead of AES-128, and SHA-384/512-class hashes. There is no Shor-style break for AES, SHA-2, or SHA-3. The same applies to China's SM4/SM3 (see sm-algorithms.html).

Are PQC algorithms slower than RSA/ECC?

For computation, the standardized lattice schemes (ML-KEM, ML-DSA) are often faster than RSA. The main cost is size: larger keys, ciphertexts, and signatures, which increases bandwidth and can affect protocols with tight packet budgets. See performance.html.

Choices and standards

Which algorithm should I use?

For most uses: ML-KEM-768 for key establishment and ML-DSA-65 for signatures. Use Falcon/FN-DSA when signature size is critical, stateful LMS/XMSS for firmware signing, and SLH-DSA when you want a hash-only security assumption. Note, however, that FN-DSA/Falcon is not yet a final FIPS standard and is more complex to implement. See comparison.html.

Why use hybrid (classical + PQC) instead of PQC alone?

Hybrid combines a well-understood classical algorithm with a post-quantum one so that the connection stays secure if either holds. It hedges against an undiscovered flaw in the still-young PQC schemes while delivering quantum resistance today. Many deployments (e.g., TLS) start hybrid for this reason. See hybrid.html.

Are the standards final?

The core ones are. NIST published FIPS 203 (ML-KEM), 204 (ML-DSA), and 205 (SLH-DSA) as final standards in August 2024. FN-DSA (Falcon) is forthcoming as FIPS 206, which is still a draft and not yet a final standard as of June 2026 — its Initial Public Draft has not yet been published, remaining in NIST / U.S. Department of Commerce clearance (publication of the draft and then the final standard is expected around 2026–2027), and additional KEMs such as HQC are progressing. Stateful hash signatures are covered by SP 800-208. See standards.html.

Can I just swap RSA for a PQC algorithm and be done?

Rarely. Larger sizes, new failure modes, protocol negotiation, certificate formats, and library support all change. The durable answer is crypto-agility: architect so algorithms can be replaced without re-engineering. See crypto-agility.html.

What about Bitcoin / blockchain and Web3?

Blockchains rely heavily on ECDSA/EdDSA signatures, which Shor breaks. Exposed public keys (e.g., reused addresses) are particularly vulnerable. Web3 projects should track PQC signature standards and plan key-rotation and migration paths early.

Does China need PQC if it uses SM algorithms?

Yes. SM2 and SM9 are classical public-key algorithms broken by Shor exactly like RSA/ECC. Adopting SM is a sovereignty/compliance step, not a quantum-safety one. See china-overview.html.

Where do I start?

Inventory your cryptography (build a CBOM), identify Shor-vulnerable, long-lived assets, adopt crypto-agility, pilot hybrid key exchange, and follow a phased playbook.html.

Standards & references

Note
The single most useful action you can take today costs nothing in new cryptography: find out where you use public-key cryptography and how long your data must stay secret. Everything else follows from that inventory.

常见问题

用通俗语言回答团队启动后量子迁移时最常提出的问题。如需深入了解,请沿各答案中的交叉链接继续阅读。

威胁与时机

我的数据现在面临风险吗

有可能。目前尚无公开的量子计算机能攻破 RSA 或 ECC,但先收集、后解密(Harvest Now, Decrypt Later, HNDL)的威胁真实存在:攻击者可以现在记录你的加密流量,待密码学相关量子计算机(CRQC)出现后再解密。如果你的数据须保密十年以上,应视其为已处于风险之中并优先迁移。

RSA 什么时候会被攻破

无人能给出确切时间。多数迁移指南不依赖精确预测,而采用 Mosca 不等式:用数据保密期、迁移所需时间与 CRQC 可能出现时间之间的关系来决定是否立即行动。诚实的规划答案来自 Mosca 不等式:若数据须保密的时长加上迁移所需时长超过 CRQC 到来的时间,你就已经迟了。应据此不等式规划,而非盯着某个日历日期。

既然量子计算机尚不存在 我现在还需要做什么吗

需要。迁移耗时数年,而先存后解意味着拖延就等于放弃今天数据的机密性。请立即启动盘点与密码敏捷性建设。

技术本身

运行后量子密码需要量子计算机吗

不需要。后量子算法运行在普通经典计算机上——笔记本、服务器、手机、智能卡皆可。它们只是被认为能抵御量子攻击的新数学难题。这里的量子指的是它们所防御的威胁,而非它们运行的硬件。

QKD 与 PQC 有何区别

QKD(量子密钥分发)依靠量子物理,通过专用硬件与光纤/光链路交换密钥;它受距离与基础设施限制,且本身不提供认证。PQC 是运行于现有硬件、随处可用的软件/数学方案,直接替换现有公钥算法。NIST、NSA 及多数标准组织推荐 PQC 作为通用方案,QKD 通常适用于具备专用链路和高保障需求的特定场景,不能替代身份认证和通用协议栈升级。二者不可互换。

对称密码对量子计算机安全吗

大体上安全。Grover 算法对对称密码与杂凑仅带来平方级加速,应对之道是增大长度:使用 AES-256 替代 AES-128,并采用 SHA-384/512 级别的杂凑。AES、SHA-2、SHA-3 不存在 Shor 式的攻破。中国的 SM4/SM3 同理(参见 sm-algorithms.html)。

后量子算法比 RSA/ECC 慢吗

在计算性能上,已标准化的格方案(ML-KEM、ML-DSA)往往比 RSA 更快。主要代价在于体积:更大的密钥、密文与签名,这会增加带宽占用,并可能影响报文预算紧张的协议。参见 performance.html

选型与标准

我应该用哪个算法

多数场景:密钥建立用 ML-KEM-768,签名用 ML-DSA-65。签名体积关键时用 Falcon/FN-DSA,固件签名用有状态的 LMS/XMSS,需要仅依赖杂凑安全假设时用 SLH-DSA。但需注意 FN-DSA/Falcon 尚非最终 FIPS 标准,且实现复杂度更高。参见 comparison.html

为什么要用混合模式而非单独使用 PQC

混合模式将成熟的经典算法与后量子算法组合,只要其中任一仍未被攻破,连接即保持安全。它在交付当下抗量子能力的同时,对冲了尚显年轻的后量子方案可能存在的未知缺陷。许多部署(如 TLS)正因此从混合模式起步。参见 hybrid.html

标准定稿了吗

核心标准已定稿。NIST 于 2024 年 8 月发布了 FIPS 203(ML-KEM)、204(ML-DSA)与 205(SLH-DSA)正式标准。FN-DSA(Falcon)将作为 FIPS 206 发布,但截至 2026 年 6 月仍处于草案阶段、尚未成为最终标准——其初稿 IPD 亦尚未公开发布,仍处于 NIST / 美国商务部审批(clearance)阶段,草案与终版预计 2026—2027 年前后发布,HQC 等额外 KEM 亦在推进。有状态杂凑签名由 SP 800-208 涵盖。参见 standards.html

我能否直接把 RSA 换成某个后量子算法就完事

很少能如此。更大的体积、新的失败模式、协议协商、证书格式以及库支持都会发生变化。可持续的答案是密码敏捷性:在架构上支持算法替换而无需重构。参见 crypto-agility.html

比特币/区块链与 Web3 怎么办

区块链高度依赖 ECDSA/EdDSA 签名,而 Shor 算法能将其攻破。已暴露的公钥(如复用地址)尤其脆弱。Web3 项目应跟进后量子签名标准,并尽早规划密钥轮换与迁移路径。

中国用了商密算法还需要后量子密码吗

需要。SM2 与 SM9 是经典公钥算法,与 RSA/ECC 一样会被 Shor 攻破。采用商密是自主可控与合规层面的举措,而非抗量子层面的升级。参见 china-overview.html

我该从哪里开始

盘点你的密码使用(构建 CBOM),识别易受 Shor 攻击且生命周期长的资产,建立密码敏捷性,试点混合密钥交换,并遵循分阶段的 playbook.html

标准与参考

说明
今天你能采取的最有用行动无需任何新密码:弄清你在哪里使用了公钥密码,以及你的数据须保密多久。其余一切都从这份盘点出发。
⚑ Report an error⚑ 纠错与校正