Quantum Computing Could Break Bitcoin-Like Encryption Far Easier Than Intially Thought, Google Researcher Says

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.

The finding did not specifically mention bitcoin BTC$92,175.09 or other cryptocurrencies, but took aim at the encryption methods that form the technical backbone used to secure crypto wallets and, in some cases, transactions.

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.

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.

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.

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.

“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.

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.

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.

“This is a 20-fold decrease in the number of qubits from our previous estimate,” Gidney said in a post.
A 20x efficiency boost in quantum cost estimation for RSA may reflect algorithmic trends that could eventually apply to ECC too. RSA is still very widely used in TLS, email encryption, and certificate authorities, which are all vital to the infrastructure crypto often piggybacks on.

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.

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.

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