Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Formalizing Blockchain PQC migration: When Is the Migration Deadline?

Kigen Fukuda

Published May 28, 2026• 0 citations
OpenAlex

Abstract

It is widely recognized that quantum computers pose a fundamental threat to blockchain security. Post-quantum cryptography (PQC) migration is therefore an urgent challenge, yet the following question has remained unanswered: by when must the migration be completed to maintain the security of crypto assets? To address this question, we first formalize the migration process and the quantum adversary based on the Bitcoin backbone protocol framework. We then establish a threshold on the tolerable quantum adversary's capability. Specifically, we prove that a security property migration liveness holds with overwhelming probability if and only if Δeff ≥ Δ∗= ⌈4/(1 − )⌉, where Δeff is the number of rounds from the broadcast of a migration transaction until the quantum adversary can produce a forged transaction, is the honest mining success probability, and is the concentration quality of the underlying random variables. We further extend the analysis to encompass broader classes of blockchains and migration paths by parameterizing the number of honest blocks required during the migration window, with practical implications for real-world deployment.

Related papers

Breaking the Post-Quantum Cryptography Blockchain Migration Trilemma: The Adaptive Quantum Migration Protocol A Temporal Decoupling Framework for Simultaneous Quantum Security, Performance, and Compatibility in Blockchain Systems

Laudza Kusuma

The imminent threat of cryptographically relevant quantum computers to blockchain infrastructure presents a fundamental engineering challenge we term the PQC Blockchain Migration Trilemma: existing migration approaches cannot simultaneously achieve quantum security, performance parity, and backward compatibility with deployed infrastructure. This paper formally characterizes this trilemma, proves its existence through incompatibility analysis of current PQC standards including CRYSTALS-Dilithium, FALCON, and SPHINCS+, and proposes the Adaptive Quantum Migration Protocol, or AQMP a novel framework employing temporal decoupling, ZK-aggregated PQC proofs, dual-commit layers, and decentralized quantum threat oracles to resolve all three dimensions concurrently. Simulation results demonstrate AQMP achieves a 93% security score, 87% performance score, and 91% compatibility score the first proposal to break the trilemma. We analyze deployment pathways for Bitcoin, Ethereum, and permissioned blockchains with estimated migration timelines of 24 to 48 months with zero downtime.

•Mar 13, 2026•0 citations

Cryptocurrencies in the Quantum Age: Migration Paths to PQC

Aleksei Kodukhov

Quantum computers pose a fundamental threat to blockchain systems that rely on elliptic-curve cryptography. This work reviews the quantum vulnerabilities and associated economic risks of major blockchain platforms, with a focus on Bitcoin, Ethereum, and Solana. We distinguish between at-rest, on-spend, and on-setup attacks and identify the blockchain components most exposed to quantum adversaries. We further review practical migration strategies toward post-quantum security, including NIST-standardized digital signatures and emerging solutions for Solana, Algorand, and Ethereum.

arXiv:2608.22924•Aug 24, 2026•0 citations

When and How to Use Post-Quantum Cryptography: A Systematic Literature Review

Tasneem Annahdi, Albandari Alsumayt, Naya Nagy

Post-quantum cryptography (PQC) is driven by the threat posed by quantum computers, particularly the harvest-now-decrypt-later attack. PQC aims to prepare classical systems and hardware to become resilient against quantum attacks. This research discusses the system vulnerabilities, the need to migrate to PQC, and how to integrate this migration. PQC has become one of the solutions for addressing today’s vulnerabilities and threats while increasing security. The paper concludes that harvest-now-decrypt-later, Q-Day attacks, and new quantum attacks are today’s most critical threats, which can be addressed by deploying PQC solutions and, thus, increasing security. This research proposes a conceptual multi-phased model framework for the migration. The framework first addresses system objectives, goals and assets, then ranks assets based on the highest sensitivity. Crypto-Agility is achieved via the automation of PQC migration, such as the automation of re-keying endpoints, followed by the automation of auditing and testing of each migration stage. Human judgment is required to review the migration process. Once one asset is successfully transitioned, the framework goes to the next highest asset; otherwise, testing is repeated. This is expected to help systems migrate at the lowest cost and with the fewest consequences. However, the limitation of PQC migration is its high resource cost, time, requirement of human professionals, burden on existing systems, and financial expenses. Lastly, the paper recommends creating an ML model to help rank a system’s data and vulnerabilities. Moreover, the paper recommends conducting experiments to evaluate the effectiveness of the proposed framework. In addition, the paper recommends performing migration in relation to a real-world company.

Network•Aug 31, 2026•0 citations

Architecting Quantum-Resilient Blockchains: A Systems Framework for Post-Quantum Security, Governance, and Migration

Hamed Taherdoost

Quantum computing poses a significant threat to blockchain systems that rely on elliptic curve cryptography and other classical security mechanisms. Algorithms such as Shor’s and Grover’s can weaken or completely break the cryptographic foundations of current blockchain networks, exposing them to risks including private key recovery, transaction forgery, consensus manipulation, and harvest-now-decrypt-later attacks. This paper presents a systems framework for designing quantum-resilient blockchains by integrating post-quantum cryptographic standards, threat modeling, architectural redesign, governance mechanisms, and migration planning. The study evaluates major post-quantum cryptographic primitives, assesses their suitability for blockchain environments, and proposes a layered architecture grounded in crypto-agility, defense-in-depth, and forward secrecy. A structured migration strategy is also introduced to support the transition of existing blockchain networks toward post-quantum security while maintaining operational continuity and stakeholder trust. The framework provides practical guidance for researchers, developers, and policymakers preparing blockchain ecosystems for the post-quantum era.

Cryptography•Aug 1, 2026•0 citations

Post-Quantum Security of the Bitcoin Backbone and Quantum Multi-Solution Bernoulli Search.

Alexandru Cojocaru, Juan A. Garay, Aggelos Kiayias +2 more

Bitcoin and its underlying blockchain protocol have recently received significant attention in the context of building distributed systems and foundations of the consensus problem. At the same time, the rapid development in quantum computing makes the threats to cryptography more and more concerning. In this work, we revisit the formal security of the core of the Bitcoin consensus protocol, called the Bitcoin backbone (Eurocrypt 2015), in the presence of quantum adversaries -- i.e. adversaries equipped with quantum computers. We show that the security of the Bitcoin backbone holds under a quantum analogue of the ``honest majority'' assumption that we develop. The critical ingredient of proving security of the blockchain is to analyzing the quantum query complexity of a Chain-of-Proofs-of-Work search problem. This problem in turn reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity. This can be viewed as an extension of a threshold direct product theorem to an average-case unstructured search problem. Our proof, adding to active recent efforts, simplifies and generalizes the powerful recording technique due to Zhandry (Crypto 2019). Our analysis indicates that the security of the Bitcoin backbone protocol is guaranteed provided that the number of adversarial quantum queries is bounded so that each quantum query is worth $O(p^{-1/2})$ classical ones, where $p$ is the probability of success of a single classical query to the protocol's underlying hash function. Perhaps surprisingly, the wait time for safe settlement of transactions in the case of quantum adversaries matches (up to a constant) the safe settlement time in the classical case and thus does not result in any further overhead.

•Dec 30, 2020•3 citations

QUANTUM COMPUTING AND BLOCKCHAIN SECURITY: A CRITICAL ASSESSMENT OF CRYPTOGRAPHIC VULNERABILITIES AND POST-QUANTUM MIGRATION STRATEGIES

Mati Ullah, Amjad Ali, Atif Khan Jadoon

This paper examines the growing threat that quantum computing presents to blockchain security. Core blockchain cryptographic frameworks, specifically the Elliptic Curve Digital Signature Algorithm and the Secure Hash Algorithm 256, are vulnerable to quantum algorithms. Both the Shor algorithm and the Grover algorithm are capable of breaking the Elliptic Curve Digital Signature Algorithm, enabling attackers to calculate private keys from public keys, while the Grover algorithm can also compromise hash-based systems that depend on brute-force methods, such as Proof-of-Work. On-chain analysis indicates that billions of dollars’ worth of crypto-assets are held in addresses susceptible to these quantum attacks. A proposed countermeasure is migration to Post-Quantum Cryptography, which incorporates quantum-resistant algorithms, such as CRYSTALS-Dilithium and Falcon. However, this migration introduces a trilemma among network security, decentralization, and performance. Post-Quantum Cryptography algorithms significantly increase transaction sizes and computational costs, which pose economic and technical challenges for large blockchain networks. The paper further discusses how the timeline for quantum advancements will be shaped by geopolitical competition, and how the catch-the-crop, decrypt-later strategy puts current data at risk from future quantum decryption. It emphasizes that active migration to Post-Quantum Cryptography is urgent, calling on stakeholders to prioritize system audits, transition to cryptographically flexible infrastructures, promote research into quantum-resistant solutions, and establish governance frameworks that enable prompt and decentralized upgrades.

Policy Research Journal•Jan 1, 2025•0 citations
It is widely recognized that quantum computers pose a fundamental threat to blockchain security. Post-quantum cryptography (PQC) migration is therefore an urgent challenge, yet the following question has remained unanswered: by when must the migration be completed to maintain the security of crypto assets? To address this question, we first formalize the migration process and the quantum adversary based on the Bitcoin backbone protocol framework. We then establish a threshold on the tolerable quantum adversary's capability. Specifically, we prove that a security property migration liveness holds with overwhelming probability if and only if Δeff ≥ Δ∗= ⌈4/(1 − )⌉, where Δeff is the number of rounds from the broadcast of a migration transaction until the quantum adversary can produce a forged transaction, is the honest mining success probability, and is the concentration quality of the underlying random variables. We further extend the analysis to encompass broader classes of blockchains and migration paths by parameterizing the number of honest blocks required during the migration window, with practical implications for real-world deployment.
The imminent threat of cryptographically relevant quantum computers to blockchain infrastructure presents a fundamental engineering challenge we term the PQC Blockchain Migration Trilemma: existing migration approaches cannot simultaneously achieve quantum security, performance parity, and backward compatibility with deployed infrastructure. This paper formally characterizes this trilemma, proves its existence through incompatibility analysis of current PQC standards including CRYSTALS-Dilithium, FALCON, and SPHINCS+, and proposes the Adaptive Quantum Migration Protocol, or AQMP a novel framework employing temporal decoupling, ZK-aggregated PQC proofs, dual-commit layers, and decentralized quantum threat oracles to resolve all three dimensions concurrently. Simulation results demonstrate AQMP achieves a 93% security score, 87% performance score, and 91% compatibility score the first proposal to break the trilemma. We analyze deployment pathways for Bitcoin, Ethereum, and permissioned blockchains with estimated migration timelines of 24 to 48 months with zero downtime.
Quantum computers pose a fundamental threat to blockchain systems that rely on elliptic-curve cryptography. This work reviews the quantum vulnerabilities and associated economic risks of major blockchain platforms, with a focus on Bitcoin, Ethereum, and Solana. We distinguish between at-rest, on-spend, and on-setup attacks and identify the blockchain components most exposed to quantum adversaries. We further review practical migration strategies toward post-quantum security, including NIST-standardized digital signatures and emerging solutions for Solana, Algorand, and Ethereum.
Post-quantum cryptography (PQC) is driven by the threat posed by quantum computers, particularly the harvest-now-decrypt-later attack. PQC aims to prepare classical systems and hardware to become resilient against quantum attacks. This research discusses the system vulnerabilities, the need to migrate to PQC, and how to integrate this migration. PQC has become one of the solutions for addressing today’s vulnerabilities and threats while increasing security. The paper concludes that harvest-now-decrypt-later, Q-Day attacks, and new quantum attacks are today’s most critical threats, which can be addressed by deploying PQC solutions and, thus, increasing security. This research proposes a conceptual multi-phased model framework for the migration. The framework first addresses system objectives, goals and assets, then ranks assets based on the highest sensitivity. Crypto-Agility is achieved via the automation of PQC migration, such as the automation of re-keying endpoints, followed by the automation of auditing and testing of each migration stage. Human judgment is required to review the migration process. Once one asset is successfully transitioned, the framework goes to the next highest asset; otherwise, testing is repeated. This is expected to help systems migrate at the lowest cost and with the fewest consequences. However, the limitation of PQC migration is its high resource cost, time, requirement of human professionals, burden on existing systems, and financial expenses. Lastly, the paper recommends creating an ML model to help rank a system’s data and vulnerabilities. Moreover, the paper recommends conducting experiments to evaluate the effectiveness of the proposed framework. In addition, the paper recommends performing migration in relation to a real-world company.
Quantum computing poses a significant threat to blockchain systems that rely on elliptic curve cryptography and other classical security mechanisms. Algorithms such as Shor’s and Grover’s can weaken or completely break the cryptographic foundations of current blockchain networks, exposing them to risks including private key recovery, transaction forgery, consensus manipulation, and harvest-now-decrypt-later attacks. This paper presents a systems framework for designing quantum-resilient blockchains by integrating post-quantum cryptographic standards, threat modeling, architectural redesign, governance mechanisms, and migration planning. The study evaluates major post-quantum cryptographic primitives, assesses their suitability for blockchain environments, and proposes a layered architecture grounded in crypto-agility, defense-in-depth, and forward secrecy. A structured migration strategy is also introduced to support the transition of existing blockchain networks toward post-quantum security while maintaining operational continuity and stakeholder trust. The framework provides practical guidance for researchers, developers, and policymakers preparing blockchain ecosystems for the post-quantum era.
Bitcoin and its underlying blockchain protocol have recently received significant attention in the context of building distributed systems and foundations of the consensus problem. At the same time, the rapid development in quantum computing makes the threats to cryptography more and more concerning. In this work, we revisit the formal security of the core of the Bitcoin consensus protocol, called the Bitcoin backbone (Eurocrypt 2015), in the presence of quantum adversaries -- i.e. adversaries equipped with quantum computers. We show that the security of the Bitcoin backbone holds under a quantum analogue of the ``honest majority'' assumption that we develop. The critical ingredient of proving security of the blockchain is to analyzing the quantum query complexity of a Chain-of-Proofs-of-Work search problem. This problem in turn reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity. This can be viewed as an extension of a threshold direct product theorem to an average-case unstructured search problem. Our proof, adding to active recent efforts, simplifies and generalizes the powerful recording technique due to Zhandry (Crypto 2019). Our analysis indicates that the security of the Bitcoin backbone protocol is guaranteed provided that the number of adversarial quantum queries is bounded so that each quantum query is worth O(p−1/2)O(p^{-1/2})O(p−1/2) classical ones, where ppp is the probability of success of a single classical query to the protocol's underlying hash function. Perhaps surprisingly, the wait time for safe settlement of transactions in the case of quantum adversaries matches (up to a constant) the safe settlement time in the classical case and thus does not result in any further overhead.
This paper examines the growing threat that quantum computing presents to blockchain security. Core blockchain cryptographic frameworks, specifically the Elliptic Curve Digital Signature Algorithm and the Secure Hash Algorithm 256, are vulnerable to quantum algorithms. Both the Shor algorithm and the Grover algorithm are capable of breaking the Elliptic Curve Digital Signature Algorithm, enabling attackers to calculate private keys from public keys, while the Grover algorithm can also compromise hash-based systems that depend on brute-force methods, such as Proof-of-Work. On-chain analysis indicates that billions of dollars’ worth of crypto-assets are held in addresses susceptible to these quantum attacks. A proposed countermeasure is migration to Post-Quantum Cryptography, which incorporates quantum-resistant algorithms, such as CRYSTALS-Dilithium and Falcon. However, this migration introduces a trilemma among network security, decentralization, and performance. Post-Quantum Cryptography algorithms significantly increase transaction sizes and computational costs, which pose economic and technical challenges for large blockchain networks. The paper further discusses how the timeline for quantum advancements will be shaped by geopolitical competition, and how the catch-the-crop, decrypt-later strategy puts current data at risk from future quantum decryption. It emphasizes that active migration to Post-Quantum Cryptography is urgent, calling on stakeholders to prioritize system audits, transition to cryptographically flexible infrastructures, promote research into quantum-resistant solutions, and establish governance frameworks that enable prompt and decentralized upgrades.