Quantum Computing Advances Heighten Threat to ECC and Bitcoin
- New research indicates that the resources required for a utility-scale quantum computer to break elliptic-curve cryptography (ECC) are significantly lower than estimates from previous years.
- One whitepaper focuses on the use of neutral atoms as reconfigurable qubits, which are the quantum analogs to classical computing bits.
- A separate whitepaper from Google researchers focuses specifically on the secp256k1 curve used by Bitcoin and other cryptocurrencies.
New research indicates that the resources required for a utility-scale quantum computer to break elliptic-curve cryptography (ECC) are significantly lower than estimates from previous years. Two independent whitepapers suggest that cryptographically relevant quantum computing (CRQC) is making meaningful progress, potentially threatening the security of blockchains and other vital cryptosystems.
One whitepaper focuses on the use of neutral atoms as reconfigurable qubits, which are the quantum analogs to classical computing bits. This architecture allows qubits to have free access to one another, which researchers claim could enable a quantum computer to break 256-bit ECC in 10 days. This approach reportedly uses 100 times less overhead than earlier estimates, potentially requiring fewer than 30,000 physical qubits.
A separate whitepaper from Google researchers focuses specifically on the secp256k1 curve used by Bitcoin and other cryptocurrencies. The Google research demonstrates a method to break these ECC-securing blockchains in less than nine minutes, achieving a 20-fold reduction in required resources compared to previous projections.
Technical Drivers of Quantum Advancement
These developments are driven by two primary factors: new quantum architectures and more efficient algorithms. Physicists and computer scientists are developing architectures that allow quantum computers to operate correctly despite errors that occur when qubits interact with their environment.
researchers are using more efficient algorithms to enhance Shor’s algorithm. Developed in 1994, Shor’s algorithm proved that quantum computing could break RSA and ECC cryptosystems in polynomial time—specifically cubic time. This is substantially faster than the exponential time required by classical computers to perform the same tasks.
Google’s Response and Mitigation Strategies
On March 31, 2026, Google Research released a blog post detailing their efforts to disclose these vulnerabilities responsibly. Ryan Babbush, Director of Research for Quantum Algorithms, and Hartmut Neven, VP of Engineering for Google Quantum AI, stated that the goal is to raise awareness and provide the cryptocurrency community with recommendations to improve stability before such attacks become possible.

Google is urging a transition to post-quantum cryptography (PQC), which is designed to be resistant to quantum attacks. To share their findings without providing a roadmap for malicious actors, Google engaged with the U.S. Government to describe these vulnerabilities using a zero-knowledge proof, allowing the findings to be verified securely.
Google has been involved in the transition to post-quantum cryptography since 2016 and is working toward a 2029 timeline. This effort involves collaboration with other industry entities, including the Ethereum Foundation, Coinbase, and the Stanford Institute for Blockchain Research.
Current Status of the Research
While these findings signal a significant shift in the projected timeline and resource requirements for CRQC, neither of the two primary whitepapers has been peer-reviewed.
The research highlights a critical vulnerability in the public-key cryptography that currently protects confidential information and digital assets. The shift toward PQC is presented as the primary defense against the eventual realization of utility-scale quantum computers capable of executing these attacks.
