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

The previous installment of this series delved into the principles of quantum computing, a revolutionary technology that leverages the unique properties of particles at the atomic and subatomic level to perform calculations that are exponentially faster and more powerful than those of classical computers. However, understanding the inner workings of a quantum computer is only half the story; the other half involves grasping how such a machine can be utilized to compromise the security of bitcoin, the world's most widely recognized cryptocurrency. This requires an in-depth examination of bitcoin's encryption methodology, the vulnerabilities it presents, and the role of quantum algorithms in exploiting these weaknesses. Bitcoin's security is rooted in a complex system known as elliptic curve cryptography, which enables the verification of transactions without revealing the private keys that control the funds. This system is akin to a one-way function, where it is relatively straightforward to generate a public key from a private key but virtually impossible to reverse-engineer the private key from the public key using conventional computing power. The security of this system is based on the elliptic curve discrete logarithm problem, which has been mathematically proven to be insoluble with current computational capabilities, with estimates suggesting that solving it would take longer than the age of the universe. However, the advent of quantum computing, particularly through the development of Shor's algorithm, has introduced a potential threat to this security model. Shor's algorithm is a quantum algorithm that can efficiently solve the discrete logarithm problem, thereby compromising the encryption that secures bitcoin transactions. The algorithm operates by converting the problem into finding the period of a function related to the elliptic curve, which can be efficiently computed using quantum properties such as superposition, entanglement, and interference. While Shor's algorithm has been known for over three decades, its practical application has been hindered by the requirement for a large-scale quantum computer with stable qubits. Recent research by Google, in collaboration with the Ethereum Foundation and Stanford University, has made significant strides in this area, reducing the estimated number of qubits required to run Shor's algorithm against bitcoin's elliptic curve from millions to fewer than 500,000. This breakthrough has profound implications for the security of bitcoin, as it brings the possibility of a quantum computer capable of breaking bitcoin's encryption closer to reality. The research introduced a practical attack scenario, where parts of Shor's algorithm can be precomputed, allowing a quantum computer to be primed and ready to attack the moment a target public key appears. This has significant implications for the security of bitcoin, particularly for the 6.9 million bitcoin that have already had their public keys exposed on the blockchain, making them vulnerable to an 'at-rest' attack. Furthermore, the average block confirmation time of 10 minutes provides a narrow window of approximately nine minutes for a quantum attacker to derive a private key and submit a competing transaction, highlighting the urgent need for the bitcoin community to address these vulnerabilities and develop strategies to mitigate the risks posed by quantum computing.