“The focus on Bitcoin appears to be synthesis on Decrypt's part - it's not mentioned once in the paper.”
How to factor 2048 bit RSA integers with less than a million noisy qubits
估算不到一百万含噪量子比特、不到一周即可分解 2048 位 RSA。
作者此前(Gidney+Ekerå 2019)估算 2048 位 RSA 需要 2000 万含噪量子比特、约 8 小时。本文大幅减少所需量子比特:估计不到一百万个含噪量子比特、不到一周即可分解 2048 位 RSA,假设与 2019 年相同(方形格点、最近邻连接、0.1% 门错误率、1 微秒表面码周期、10 微秒控制系统反应时间)。比特数减少主要来自近似剩余算术、用 yoked 表面码存储空闲逻辑比特,以及用魔态培育取代部分魔态蒸馏;运行时间变长主要因为 Toffoli 门更多、魔态工厂更少,但 Toffoli 数量比 2024 年相关工作减少了 100 倍以上。
评论者把它当作分解 RSA-2048 最新资源估算的出处,引用其“不到一百万含噪量子比特、数天到数周破解一个密钥”的数字,说明量子攻击的成本十年间大幅下降,并指出媒体强调的比特币在论文里一次都没出现。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“In the past ten years, on the theory side, the expected cost of cryptographically relevant quantum factoring has dropped by 1000x [1][2].”
“Latest numbers are about 1e6 qubits with 1e-4 error rate: How to factor 2048 bit RSA integers with less than a million noisy qubits”
“Table 5 of [1] estimates 7 billion Toffoli gates to factor 2048 bit RSA integers.”
“How to factor 2048 bit RSA integers with less than a million noisy qubits shows a factoring algorithm using 1 million qbits and ~10^10 gates.”
“will take days to weeks to break a single key [0].”
看全部 10 条 →
“is the most recent costing of factoring various size of N”
“Factoring cryptographically relevant numbers needs ~1,000,000 qubits at ~3 nines [1].”
“"How to factor 2048 bit RSA integers with less than a million noisy qubits" is the most up to date paper here, and uses ~1400 logical and ~900k physical”
“In 2025, we know we need fewer than 1 million. [0].”
- How to factor 2048 bit RSA integers with less than a million noisy qubits ↗vtomole · 2025-05-23 · 3 分