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.

目的不是今天打破比特幣，而是要衡量當前系統的距離。