The Quantum Threat to Bitcoin: How a Powerful Computer Can Steal Your Cryptocurrency in Under 10 Minutes

This series explores the intersection of quantum computing and bitcoin security. The first part delved into the fundamentals of quantum computing, while this piece focuses on the potential vulnerabilities of bitcoin's encryption. Bitcoin relies on elliptic curve cryptography, which is based on the concept of a one-way function. This function allows for easy calculation in one direction but makes it virtually impossible to reverse the process using classical computers. However, the advent of quantum computing, particularly with the development of Shor's algorithm, poses a significant threat to this security model. Shor's algorithm can efficiently solve the discrete logarithm problem, which is the foundation of elliptic curve cryptography. By leveraging quantum properties such as superposition, entanglement, and interference, a quantum computer can potentially break the encryption used to secure bitcoin transactions. Google's recent research has reduced the estimated number of qubits required to launch such an attack, making the threat more tangible. The study introduced a practical attack scenario where a quantum computer can precompute parts of the algorithm, waiting for a target public key to appear. Once a public key is broadcast, the quantum computer has approximately nine minutes to derive the private key and submit a competing transaction. This timeframe is alarming, given that bitcoin's average block confirmation time is around 10 minutes. The vulnerability is not limited to new transactions; approximately 6.9 million bitcoin, or roughly one-third of the total supply, are already exposed and vulnerable to an 'at-rest' attack. As quantum computing technology advances, the gap between the potential for attack and the current state of hardware is closing. The implications of these findings and the potential consequences for bitcoin security will be explored in the final piece of this series.