Could Quantum Computers Defeat Bitcoin? Not So Fast

A hacker managed to steal $600 million in funds from the Ronin network this week by securing the private keys belonging to 5 of 9 validator nodes on the network. Bitcoin guru Andreas Antonopolous has suggested the adoption of Lamport signatures. Other potential post-quantum algorithms include Dilithium, Falcon and Rainbow. According to Chainalysis, about 25% of bitcoins are believed to be lost forever in this manner.

The tree has n leaves, with transactions in leaves ordered from left to right T0, T1, …, Tn. The first leaf T0 contains the nonce, but the other transactions are permanent. The fields affected by the change of the nonces are marked with a red circle. Section 2 shows previous connections between Bitcoin and quantum cryptography/computation, both as a threat and also some solutions.

Cryptography Gets Busted

However, advances in ASIC technology are likely to push back this date much farther,” according to the study in ScienceDirect. Otherwise, the only real justification would be for a state actor, motivated by control, not direct financial gain, to build a quantum computer capable of breaking Bitcoin. But if their intention is to destroy or subvert it, there are less complicated options. That machine would have to be built in complete secrecy, without Bitcoin’s Protocol changing to apply resistant signatures.

Efforts must be put into research and development to bolster the Bitcoin network’s strength to keep it up to date with the changing technological landscape. However, is the Bitcoin network strong enough to face the challenge of quantum computing? Before answering this, let us first highlight some of the advantages of quantum computing and why the decision to put an outright ban on this emerging technology might not be the best course of action to follow. NewsBTC is a cryptocurrency news service that covers bitcoin news today, technical analysis & forecasts for bitcoin price and other altcoins.

The next step computes the hash of the 4-tuple, given the nonce in the block header. The final step is the measurement, which identifies the two nonce values with sufficiently high probability . The algorithm computes all the permanent values at the start and only once. As shown in Section 3.1, whenever the nonces change values, only a few nodes in the Merkle tree change.

Can Quantum Computers Attack Bitcoin?

The left and the right child of such a node are also permanent as they do not depend on the nonce. Therefore, the left and the right hashes of all such nodes are also permanent. Thus, only the left hashes along the tree’s leftmost path change whenever the extra nonce changes. If there are n transactions , a change in the extra nonce value requires log2n hash recalculations to update the hash pointer at the root of the Merkle tree. If n is considered a variable parameter, an update of the leaf nonce is asymptotically more costly than an update to the header nonce.

Asymmetric encryption requires both the information and a Public Key to encrypt it – which as its name suggests can be shared – as well as a Private Key to then decrypt it. Connect and share knowledge within a single location that is structured and easy to search. Electronic musician, world traveler, and business writer who fell down the crypto rabbit hole and never climbed out. There’s no central system to it so it can’t be shut down by the inventor. The inherent technology is open source which make it even more resilient because of improvements made every time an issue turns up.

Cryptocurrencies challenge the validity of modern monetary theory, which says that the legal ordinances supported by WAVES a government are necessary to gain the acceptance and trust of a currency by the people . Bitcoin does not rely on the support of a government, but on its algorithmic design, together with voluntary human users. The security of bitcoin stems from voluntary miners maintaining the integrity of the ledger-blockchain . For extending the blockchain, miners are rewarded with new bitcoins. Touching the Bitcoin network would almost certainly be a touch of death.

The size of the extra nonce is limited by the block size defined by the Bitcoin protocol. The mining effort consists of finding golden nonces, which induce a hash value below the target value specified in the block header. The Bitcoin network determines the target value related to finding a nonce and is updated every 2016 blocks. The difficulty is increased or decreased so that the average time to discover a block is around 10 min. For Bitcoin itself, Aggarwal et al. discusses quantum attacks on today’s Bitcoin system.

computers are expected to kickstart a new wave of innovation in the field of data and predictive analytics as it facilitates the processing of numerous transactions at once. It is said that Google’s Sycamore quantum computer can successfully execute a computation in 200 seconds that IBM Summit – one of the world’s fastest supercomputers – would take 10,000 years to solve. As you can imagine, developing a quantum computing device involves massive research, development, and investment.

Shahadat Hossain

can quantum computers mine bitcoin cryptography attacks, if realized, pose a real threat to today’s security solutions in general. Most of the encryption in modern cryptocurrencies are built on elliptic curve cryptography rather than RSA — especially in the generation of signatures in bitcoin which requires ECDSA. This is largely due to the fact that elliptic curves are correspondingly harder to crack than RSA from classical computers. Miners in a proof-of-work blockchain system like Bitcoin compete to find a numerical solution to the SHA256 algorithm that beats a network target known as the difficulty. Miners perform so-called hashing operations on the header of a Bitcoin transaction block and a random number. Using the SHA256 algorithm, to obtain a numerical solution that follows a certain pattern.

Quantum computers will eventually break much of today’s encryption, and that includes the signing algorithm of Bitcoin and other cryptocurrencies. Approximately one-quarter of the Bitcoin ($168bn) in circulation in 2022 is vulnerable to quantum attack, according to a study by Deloitte. IBM is confident that it can exponentially increase the qubit number in the next few years, and we could see a processor with millions of qubits in at most 5 years, but reaching billions of qubits may take double that time.

Quantum computers operate differently from classic computers, whose logic relies on Boolean algebra consisting of only two numbers, one and zero, that respectively represent ‘on’ or ‘off’ states in resistors. The process of upgrading existing private keys, however, could create new vulnerabilities. That’s because, according to Groth, new keys will be generated by the system after successfully implementing post-quantum encryption. To activate a switch to the new key, users will have to sign for approval with their old one. By providing a higher number of states, quantum computers have the ability to perform exponentially larger computations. But there are a number of significant caveats to this technology, which we shall explore further down.

• More interestingly, the variable part of the Merkle tree is treated as quantum in nature.
• Even if a quantum computer mined merely 2016 blocks, in theory this would raise the difficulty so high that regular mining equipment would take an impossibly long time to create another 2016 blocks and reduce difficulty.
• Miners run a hashing algorithm called Proof of Work competing to find what is described as the golden hash, an arbitrary value that is difficult enough to find to ensure a consistent time to confirm new blocks of transactions.
• Other researchers have postulated that a quantum computer would require at least 317 million qubits to perform the task in an hour or two.

However, with efficient quantum computers in place, many crypto projects could pose an existential threat if they do not continually advance their security mechanisms in tandem. As a result, we might witness a resurgence of interest in privacy-oriented cryptocurrencies that use the most advanced cryptographic technologies to hide transaction privacy on the blockchain. Advanced quantum computing could also pose a challenge to blockchain protocols related to decentralized finance that custody of billions of dollars worth of users’ digital assets. Similarly, online banking transactions could also be affected, along with digital signatures used to sign cryptocurrency transactions through digital wallets. Grover’s algorithm, which can only be implemented on a quantum computer, is particularly suited for breaking SHA256, the encryption algorithm behind bitcoin mining. If you have ever read about the Bitcoin mining process, you would have most likely come across the term hashrate.

• “Our own calculations based on current ASIC technology, as well as that of other authors , put the earliest likely date that this type of attack will be possible at 2028.
• The target value t, given in the block’s header, reduces the search space to 2256/t.
• So the network raises the difficulty of slowing down block production.
• Existing solutions include efforts by IOTA developers to introduce so-called directed acyclic graph technology, and JPMorgan’s quantum key-distribution technology.
• There have been, however, a number of advancements in quantum error correction, namely something called the Bacon-Shor code developed by physicist Christopher Monroe and a number of researchers from the University of Maryland.

The result of this https://www.beaxy.com/ is an array of size at most n that contains all the right hashes in the Merkle tree, including the ones on the leftmost path. The left-hashes on the Merkle tree’s leftmost path are computed using a quantum algorithm that will be described later. The circuit that we develop in the next section has several stages. Each stage passes some of its output qubits to the next stage as input qubits. We describe the circuit in each stage using unitaries as much as possible.

Breaking this form of encryption would mean a person could ascertain someone’s private key from that person’s public key, which is freely broadcasted to the entire network each time that wallet makes a transaction. Accessing a private key is like identifying a person’s password and would give the attacker complete control over any funds held in the wallet address. “Encryption methods like RSA are based on the simple premise that factoring large numbers is computationally unattractive,” said Hurley, who has previously written about the threat quantum computers pose to today’s encryption methods.

In simple terms, SHA-256 is a mathematical operation used for storing information on the internet securely and privately. Bitcoin is mined using a special kit called the Application Specific Integration Circuits , designed specifically for mining rigs. Additionally, since the circuits employ ‘puzzle friendliness,’ each input is expected to return a good output; if not, it is detected by the entire system, and the miner is notified. Jeremy Van der Haegen is a Belgian freelance journalist who covers business and politics of the Asia-Pacific, cryptocurrencies, and blockchain technology. Sign up for Crypto for Advisors, our weekly newsletter defining crypto, digital assets and the future of finance.

The problem becomes increasingly more persistent the more qubits are involved. “The algorithmic speed-up is unlikely to make up for the considerably slower clock cycle times relative to state of the art classical computing for the foreseeable future,” according to the paper. He is co-founder and CEO of NGRAVE, the creator of “ZERO” – the world’s most secure hardware wallet for crypto storage.

We know the left and the right hash for every non-leaf node that does not lie on the leftmost path. For nodes that are on the leftmost path, we know only the value of the right hash. The hash values are computed using a post-order traversal, and the time it takes is proportional to the size of the Merkle tree (O). One of the most obvious ways to maintain Bitcoin’s security in a future with more powerful quantum computers would be to upgrade the Bitcoin network to a stronger form of encryption — often called “quantum-resistant encryption”. Some alternative quantum-resistant encryption algorithms already exist, and the main selection criteria for developers would be to use one which is efficient and wouldn’t be memory intensive. Estimates on when quantum computers could achieve the necessary qubit processing power to attack Bitcoin range from several years to a few decades.

Further, as new blocks are added to the blockchain, all the previously stored transactions are verified again and again, which makes it increasingly difficult to tamper with any prior transactions on the network. This way, it is not a stretch to say that the longer the Bitcoin network functions, the stronger it gets. Similarly, the Bitcoin network will be much more resilient to orchestrated attacks in 2032 than it is today. With the use of quantum mechanical phenomena, this type of computing could have applications that you’ve never even imagined. Fortunately, there are many people in the field of quantum computing that have put their minds to it and thought of all sorts of ways that things might change with the advent of quantum computers.

The hashes’ computations along the leftmost path in the Merkle tree happens sequentially, and the SHA-256 hash function itself is a multistage sequential circuit with a constant depth. We will see later that the quantum algorithm is also sequential for this step. This paper studies the effect of quantum computers on Bitcoin mining. The shift in computational paradigm towards quantum computation allows the entire search space of the golden nonce to be queried at once by exploiting quantum superpositions and entanglement. Using Grover’s algorithm, a solution can be extracted in time O(2256/t), where t is the target value for the nonce.