Google Quantum AI研究人员显示，破坏RSA加密可能需要比以前认为的量子资源少20倍

Google Quantum AI研究人员Craig Gidney的一份新研究论文表明，破坏广泛使用的RSA加密可能需要的量子资源比以前认为的要少20倍。

A new research paper by Google Quantum AI researcher Craig Gidney shows that breaking widely used RSA encryption may require 20 times fewer quantum resources than previously believed.

Google Quantum AI研究人员Craig Gidney的一份新研究论文表明，破坏广泛使用的RSA加密可能需要的量子资源比以前认为的要少20倍。

The finding, which did not specifically mention bitcoin, was disclosed in a new paper by Gidney, titled "HETC: A Hybrid Encoding Transform for Improved Code Generation in the NV Center Architecture." It was a follow-up to his 2019 paper, which focused on applying a hybrid encoding to reduce the number of qubits needed to factor 2048-bit RSA moduli.

该发现并未特别提及比特币，在Gidney的一份新论文中披露了“ HETC：一种混合编码转换，可改善NV中心体系结构的代码生成”。这是他2019年论文的后续行动，该报纸的重点是应用混合编码以减少2048位RSA模量所需的量子数量。

RSA is a public-key encryption algorithm used to encrypt and decrypt data. It relies on two different but linked keys: a public key for encryption and a private key for decryption.

RSA是一种用于加密和解密数据的公钥加密算法。它依靠两个不同但链接的密钥：加密的公钥和一个私有密钥进行解密。

Bitcoin doesn't use RSA, but relies on elliptic curve cryptography (ECC). However, ECC can also be broken by Shor's algorithm, a quantum algorithm designed to factor large numbers or solve logarithm problems — which form the heart of public key cryptography.

比特币不使用RSA，但依赖椭圆曲线密码学（ECC）。但是，Shor's算法也可以打破ECC，这是一种量子算法，旨在考虑大数或解决对数问题的量子，这构成了公共密钥密码学的核心。

ECC is a way to lock and unlock digital data using mathematical calculations called curves (which compute only in one direction) instead of big numbers. Think of it as a smaller key that's just as strong as a larger one.

ECC是一种使用称为曲线（仅在一个方向计算）而不是大数字的数学计算锁定和解锁数字数据的方法。将其视为较小的钥匙，与较大的钥匙一样强。

While 256-bit ECC keys are significantly more secure than 2048-bit RSA keys, quantum threats scale nonlinearly, and research like Gidney's compresses the timeline by which such attacks become feasible.

尽管256位ECC密钥比2048位RSA键的安全性要高得多，但量子威胁非线性地尺寸为“量子威胁”，并且像Gidney's这样的研究压缩了这种攻击变得可行的时间表。

"I estimate that a 2048-bit RSA integer could be factored in under a week by a quantum computer with fewer than one million noisy qubits," Gidney wrote. This was a stark revision from his 2019 paper, which estimated such a feat would require 20 million qubits and take eight hours.

Gidney写道：“我估计，一周不到一周的量子计算机，可以将2048位RSA整数在不到一周的时间内考虑到一百万个噪声量子。”这是他2019年报纸的鲜明修订，估计这项壮举需要2000万Quart，需要八个小时。

To be clear: no such machine exists yet. IBM's most powerful quantum processor to date, Condor, clocks in at just over 1,100 qubits, and Google's Sycamore has 53.

要清楚：尚无这样的机器。迄今为止，IBM最强大的量子处理器，Condor，时钟刚好超过1,100 QUAT，而Google的Sycamore有53个。

Quantum computing leverages the principles of quantum mechanics, using quantum bits or qubits instead of traditional bits.

量子计算利用量子位或量子位代替传统位来利用量子力学的原理。

Unlike bits, which represent either a 0 or a 1, qubits can represent both 0 and 1 simultaneously due to quantum phenomena like superposition and entanglement. This allows quantum computers to perform multiple calculations at once, potentially solving problems that are currently intractable for classical computers.

与代表0或1的位不同，量子位可以同时代表0和1，因为量子和纠缠等量子现象。这允许量子计算机一次执行多次计算，从而解决了当前对古典计算机棘手的问题。

"This is a 20-fold decrease in the number of qubits from our previous estimate," Gidney said in a post.

吉德尼在一篇文章中说：“这是我们先前估计的量子数减少了20倍。”

Researchers, such as the quantum research group Project 11, are actively exploring whether even weakened versions of Bitcoin's encryption can be broken by today's quantum hardware.

诸如量子研究小组11的研究人员正在积极探索当今的量子硬件甚至可以破坏比特币加密版本的版本。

The group earlier this year launched a public bounty offering 1 BTC (~$85,000) to anyone able to break tiny ECC key sizes — between 1 and 25 bits — using a quantum computer.

该小组今年早些时候推出了一个公共赏金，使用量子计算机向能够打破小型ECC钥匙尺寸（介于1到25位）的任何人提供1 BTC（约85,000美元）。

The goal isn't to break Bitcoin today, but to measure how close current systems can be.

目的不是今天打破比特币，而是要衡量当前系统的距离。