[2603.28846] Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
Abstract:This whitepaper seeks to elucidate implications that the capabilities of developing quantum architectures have on blockchain vulnerabilities and mitigation strategies. First, we provide new resource estimates for breaking the 256-bit Elliptic Curve Discrete Logarithm Problem, the core of modern blockchain cryptography. We demonstrate that Shor's algorithm for this problem can execute with either <1200 logical qubits and <90 million Toffoli gates or <1450 logical qubits and <70 million Toffoli gates. In the interest of responsible disclosure, we use a zero-knowledge proof to validate these results without disclosing attack vectors. On superconducting architectures with 1e-3 physical error rates and planar connectivity, those circuits can execute in minutes using fewer than half a million physical qubits. We introduce a critical distinction between fast-clock (such as superconducting and photonic) and slow-clock (such as neutral atom and ion trap) architectures. Our analysis reveals that the first fast-clock CRQCs would enable on-spend attacks on public mempool transactions of some cryptocurrencies. We survey major cryptocurrency vulnerabilities through this lens, identifying systemic risks associated with advanced features in some blockchains such as smart contracts, Proof-of-Stake consensus, and Data Availability Sampling, as well as the enduring concern of abandoned assets. We argue that technical solutions would benefit from accompanying public policy and discuss various frameworks of digital salvage to regulate the recovery or destruction of dormant assets while preventing adversarial seizure. We also discuss implications for other digital assets and tokenization as well as challenges and successful examples of the ongoing transition to Post-Quantum Cryptography (PQC). Finally, we urge all vulnerable cryptocurrency communities to join the ongoing migration to PQC without delay.
[2603.28846] Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations --> Quantum Physics arXiv:2603.28846 (quant-ph) [Submitted on 30 Mar 2026 ( v1 ), last revised 15 Apr 2026 (this version, v2)] Title: Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations Authors: Ryan Babbush , Adam Zalcman , Craig Gidney , Michael Broughton , Tanuj Khattar , Hartmut Neven , Thiago Bergamaschi , Justin Drake , Dan Boneh View a PDF of the paper titled Securing Elliptic Curve Cryptocurrencies against Qua
saved by
related reading
- How Quantum Computers affect Cryptography and Blockchain, and Solutionsblog.aayushg.com
- Shtetl-Optimized >> Blog Archive >> Quantum computing bombshells that are not April Foolsscottaaronson.blog
- On the Computational Hardness Needed for Quantum Cryptographysimons.berkeley.edu
- How the quantum search algorithm worksquantum.country
- [2511.17460] Improved error correction with leakage reduction units built into qubit measurement in a superconducting quantum processorarxiv.org
- [2601.20927] Entangling logical qubits without physical operationsarxiv.org
- Cryptographic Right Answers: Post Quantum Edition | Latacoralatacora.com
- thesis.pdfaayushg.com
- Experimental randomness amplificationnature.com
- [2503.10935] Bias-preserving and error-detectable entangling operations in a superconducting dual-rail systemarxiv.org
- [2606.05433] Zero knowledge verification for frontier AI training is possiblearxiv.org
- [2507.20100] Circuit simulation of readout process toward large-scale superconducting quantum circuitsarxiv.org