GirderGroup

Blockchain's Quantum Reckoning: What Bitcoin, Ethereum, and Cross-Chain Protocols Must Change

Every Bitcoin transaction is signed with ECDSA, which Shor's algorithm breaks. Every atomic swap relies on hash-time-lock contracts, which Grover's algorithm weakens. The quantum threat to blockchain is not one problem but many — and the decentralized governance model makes it harder to solve than in any centralized system.

Dwayne ThompsonEngineering, standards & trade editor · Kingston
September 29, 2026 · 8 min read
Interconnected digital nodes, representing blockchain network architecture under quantum threat.
Interconnected digital nodes, representing blockchain network architecture under quantum threat. · Image: Girder Group

Every Bitcoin transaction is authorized by an ECDSA signature, and Shor's algorithm breaks ECDSA. Every Ethereum wallet address is derived from an elliptic-curve public key, and exposing that public key — which happens the first time a wallet sends a transaction — gives a quantum adversary the input needed to recover the private key. A comprehensive risk assessment of blockchain systems under quantum computing threats, applying the STRIDE threat model to consensus mechanisms, smart contracts, and digital wallets, puts the implication plainly: for every blockchain that uses ECDSA for transaction signing, a cryptographically relevant quantum computer is a full key-compromise attack waiting to execute (Baseri et al., arXiv 2501.11798).

Key takeaways

  • Shor's algorithm directly breaks ECDSA-based transaction signing used by Bitcoin, Ethereum, Ripple, and most other major blockchains. A quantum computer running Shor's can forge any wallet signature from a public key.
  • Grover's algorithm reduces the effective security of SHA-256 proof-of-work, but not catastrophically: the difficulty adjustment mechanism provides partial mitigation, and the threat to mining is secondary to the threat to wallet security.
  • Cross-chain interoperability protocols (atomic swaps, hash time-lock contracts, bridge contracts) span multiple trust domains migrating at different speeds — creating heterogeneous security windows that make the cross-chain attack surface harder to harden than a single chain.
  • Blockchain systems face a governance barrier that centralized systems do not: cryptographic algorithm upgrades require network-wide consensus, making rapid crypto-agility institutionally harder than in a bank or a cloud provider.

How Shor's algorithm threatens wallet security

ECDSA, the Elliptic Curve Digital Signature Algorithm, is the signature scheme used by Bitcoin, Ethereum, Ripple, and most production blockchain systems. It generates a digital signature from a private key and allows verification using the corresponding public key. Shor's algorithm can, given a public key, recover the private key in polynomial time on a quantum computer. The window between public-key exposure and exploitation is narrow: in Bitcoin, a public key is revealed when a wallet address first sends a transaction (pay-to-public-key-hash addresses), and in Ethereum, public keys are permanently visible on-chain.

The risk is not symmetric across all wallet types. "Legacy" Bitcoin addresses (P2PK format) expose the public key in the locking script; "modern" P2PKH addresses expose it only on spend. A wallet that has never sent a transaction has not yet exposed its public key — but any wallet with outgoing transaction history is permanently vulnerable once quantum hardware matures. For practical purposes, the majority of circulating Bitcoin value has spent at least once and is therefore exposed.

For Ethereum, the situation is more acute: every externally owned account's public key is visible on-chain, and every smart contract interaction exposes the calling wallet's public key. An Ethereum migration to post-quantum signatures requires a protocol-level change — replacing ECDSA with ML-DSA or SLH-DSA — which requires an Ethereum Improvement Proposal, network-wide upgrade, and the resolution of storage and gas implications of larger PQC signatures.

“The weakest link in a cross-chain protocol is not the most secure chain. It is the slowest-to-migrate chain in the path.”

Grover's algorithm and the consensus problem

Grover's algorithm provides a quadratic speedup for unstructured search problems, which includes the proof-of-work mining operation. For SHA-256, the standard hash function used in Bitcoin mining, Grover's algorithm reduces the effective collision resistance from O(2^256) to approximately O(2^(n/3)), per the Brassard et al. quantum collision bound — a reduction from 256-bit to roughly 85-bit equivalent security for collision finding. For the second preimage resistance relevant to mining, the reduction is less severe: O(2^128) effective security.

The practical impact on mining is moderated by Bitcoin's difficulty adjustment mechanism: if quantum miners achieve speedups, the network raises difficulty proportionally, preserving block timing. But the economic concentration risk is significant — a single well-resourced quantum mining operation could dominate hashrate during the early adoption period, before difficulty adjusts. This is a competitive advantage problem rather than a catastrophic security failure, but it warrants pre-emptive protocol work.

Smart contract integrity presents a separate concern. Ethereum's VM state hash, used to verify contract execution across nodes, inherits hash-function security. For high-value contracts where an adversary could benefit from forging an intermediate state hash, Grover's weakening of SHA-256 is relevant to the threat model.

Cross-chain interoperability: a heterogeneous migration nightmare

Cross-chain interoperability protocols — atomic swaps, hash time-lock contracts (HTLCs), and bridge contracts used by platforms such as WBTC (Bitcoin-Ethereum), RenBTC, and Wormhole (Solana-Ethereum multi-chain messaging) — introduce a threat dynamic that single-chain analysis misses: multiple independent trust domains, each migrating to PQC at a different pace.

An HTLC, for example, commits funds on Chain A by publishing a hash commitment that can be claimed on Chain B by revealing the preimage. If Chain A has migrated to PQC but Chain B has not, the HTLC's security is bounded by the weaker chain. Grover's algorithm weakening the hash commitment on the un-migrated chain — or Shor's algorithm breaking the elliptic-curve signature verifying the claim — is sufficient to compromise the atomic swap regardless of Chain A's security posture. The weakest-link model applies across chains, not within them.

Tiwari and Chhetri (2025) note that decentralized governance makes this worse: while a bank can schedule a cryptographic migration as an internal IT project, a blockchain network upgrade requires economic consensus among validators, miners, and wallet providers. The longer a chain delays, the longer it functions as an attack surface for every cross-chain protocol that routes through it.

Two migration architectures: composite and non-composite

The STRIDE-based analysis by Baseri et al. proposes two hybrid migration architectures for blockchain systems. The composite approach runs classical and PQC signature schemes in parallel: a transaction carries both an ECDSA signature and an ML-DSA signature, requiring both to verify. This is the most conservative migration path, preserving all existing security against both classical and quantum adversaries during the transition period, at the cost of approximately doubling signature and verification overhead.

The non-composite approach selects replacement algorithms on a per-component basis, replacing ECDSA with ML-DSA for transaction signing while retaining hash functions or using SLH-DSA selectively where its larger size is acceptable. This approach has lower overhead but requires more careful threat modeling to ensure that no component is left in a transitional state that weakens the overall system.

For Zcash, the analysis notes a specific concern: its zk-SNARK-based privacy mechanism relies on elliptic-curve pairings for proof generation and verification. zk-SNARKs based on current elliptic-curve constructions are directly threatened by Shor's algorithm at the pairing-curve level, requiring migration to quantum-safe zero-knowledge proof systems — an active research area with promising candidates but no NIST-equivalent standard yet.

What this means for organizations with blockchain exposure

Distinguish wallet risk from protocol risk. Wallet-level ECDSA exposure — where a quantum adversary recovers private keys from on-chain public keys — is the most immediate and individualized threat. Protocol-level threats (mining, consensus) are systemic and can only be addressed by the network. Organizations holding significant on-chain assets should monitor migration roadmaps for the relevant networks and plan wallet migration to quantum-safe address formats as those become available.

Treat cross-chain exposure as compounded risk. If your organization relies on cross-chain protocols — bridge contracts, atomic swaps, or cross-chain messaging systems — your security posture is bounded by the least-migrated chain in the path. Inventory cross-chain dependencies and map them to the migration timelines of each underlying network.

For enterprise blockchain deployments, move faster than public networks. Private and consortium blockchains (Hyperledger, permissioned Ethereum variants) do not require public consensus to change cryptographic parameters. These networks can and should migrate to post-quantum signature schemes on an enterprise IT timeline, which is typically faster than the multi-year governance process of a public network.

Watch the zk-SNARK migration landscape. For any application using zero-knowledge proofs built on elliptic-curve pairings, follow the development of quantum-safe ZK proof systems. The research is active, and early architectural decisions about proof system design will shape migration cost significantly.

Sources

  1. 1.Baseri Y. et al., Blockchain Security Risk Assessment in Quantum Era, Migration Strategies and Proactive Defense, arXiv 2501.11798v2, August 2025.arXiv
  2. 2.Tiwari A. and Chhetri Y., Cross-Chain Vulnerabilities in the Quantum Era: A Threat Analysis to Blockchain Interoperability, 2025.Research paper
  3. 3.Rani P. et al., Obfuscated Quantum and Post-Quantum Cryptography, arXiv 2508.07635v2, October 2025.arXiv
  4. 4.FIPS 204, Module-Lattice-Based Digital Signature Standard, August 2024.National Institute of Standards and Technology
  5. 5.FIPS 205, Stateless Hash-Based Digital Signature Standard, August 2024.National Institute of Standards and Technology

Common questions

Is Bitcoin vulnerable to quantum computers today?
Not yet. No quantum computer today has the qubit count or error-correction quality needed to run Shor's algorithm at cryptographically relevant scale. Estimates for when such hardware might exist range from 10 to 20+ years. However, 'harvest now, decrypt later' attacks mean that on-chain data collected today could be decrypted in the future — and wallets with exposed public keys (any wallet with outgoing transaction history) are permanently exposed once quantum hardware arrives.
What is the difference between Shor's and Grover's algorithms for blockchain?
Shor's algorithm directly breaks public-key cryptography (ECDSA, ECDH) — it can recover a private key from a public key. This threatens wallet signing and authentication. Grover's algorithm provides a quadratic speedup for hash preimage search, weakening proof-of-work mining by roughly half the bit-security of SHA-256, but not breaking it catastrophically.

Dwayne Thompson

Engineering, standards & trade editor · Girder Group · Kingston

Dwayne Thompson writes on compliance engineering, standards (NIST), and trade and logistics regulation (CBP, DOT, FMC), from Girder Group's Kingston desk.

Meet the desk

Work with Girder Group

The systems that make these obligations provable.

Girder Group builds the platforms, portals, and cloud systems that regulated organisations run on. Talk to the firm behind this research.

Start a conversation

Stay informed

New research in your inbox.

Briefings on recordkeeping and AI governance, published as the rules develop. We never share your address.

Unsubscribe anytime.