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

A Quantum-Safe Framework for Critical Infrastructure Resilience Against Post-Quantum Cybersecurity Threats

Nandan Sharma

Published Aug 1, 2026• 0 citations
Publisher

Abstract

Critical infrastructure operators face a cryptographic transition unlike any in the internet's history: the mathematical problems underlying RSA and elliptic-curve cryptography, which secure the vast majority of today's key exchange and digital signatures, are efficiently solvable by a sufficiently large quantum computer running Shor's algorithm. No such machine exists yet, but the transition to quantum-safe alternatives cannot wait for one to appear, because encrypted data intercepted and stored today can be decrypted retroactively the moment a capable quantum computer does exist-a risk the field calls “harvest now, decrypt later.” This paper reviews the technical and policy literature on building quantum-safe resilience into critical infrastructure specifically, where equipment lifespans of ten to twenty years and hard real-time performance constraints make this transition materially harder than in general-purpose computing. This review examines the NIST finalized post-quantum cryptography standards, published in August 2024, following an eight-year selection process; the considerable performance and overhead burden imposed by such algorithms, with measured throughput between 150 operations per second on embedded ARM devices to over 13 million operations per second on server-class GPUs for the same algorithm; the very uncertain expert opinion timeline for when a cryptographically relevant quantum computer could exist, currently estimated at a 28 to 49 percent likelihood of appearing within ten years according to a survey of twenty-six experts in 2025; and finally, the regulatory deadlines for migration to such algorithms established in five different jurisdictions, which fall anywhere between 2030 and 2035. The key finding of this review can perhaps be stated plainly: Estimates of the time period actually required for a large organization to migrate to post-quantum cryptography, which range from twelve to fifteen years or more, are uncomfortably close to, and sometimes exceed, both the regulatory deadline and even the lower end of the threat timeline itself. With regard to critical infrastructure, this is not merely a theoretical exercise, but potentially an already overdue one.

DOI
10.1109/icssetes69816.2026.11764346

Related papers

Quantum Computing and the Future of Cybersecurity: Assessing the Threat to Classical Encryption Standards

Ramya ., Rashmi .

The maturation of quantum computing hardware and algorithms has transformed what was once a theoretical concern into an active planning priority for governments, enterprises, and standards bodies. This paper assesses the current and projected threat that quantum computation poses to classical public-key cryptographic standards, namely RSA, elliptic curve cryptography (ECC), and Diffie-Hellman key exchange, all of which derive their security from mathematical problems that Shor's algorithm renders tractable on a sufficiently large fault-tolerant quantum computer. We synthesize recent hardware progress, algorithmic refinements that have substantially reduced estimated qubit requirements, and the finalization of NIST's post-quantum cryptography (PQC) standards (FIPS 203, 204, and 205) to provide an evidence-based assessment of where the field stands as of mid-2026. Particular attention is given to the widening gap between optimistic resource estimates, including a contested March 2026 claim of a thousand-fold reduction in factoring resources, and the practical reality that no existing quantum computer approaches the logical qubit counts required to threaten deployed encryption. We further examine migration challenges, including performance overhead, cryptographic agility, constraints on embedded and IoT systems, and the harvest-now-decrypt-later threat model that makes migration urgency independent of exact timeline predictions. Drawing on NIST transition guidance and recent G7 coordination targets, we argue that organizations should treat cryptographic migration as a present-tense operational requirement rather than a future contingency, regardless of unresolved disagreement among experts about when a cryptographically relevant quantum computer will exist. The paper concludes with practical recommendations for risk-based migration prioritization and identifies open research questions in cryptographic agility and quantum-resistant system design.

International Journal of Innovative Science and Research Technology (IJISRT)•Jul 31, 2026•0 citations

Quantum-Safe Cryptography: Securing the Post-Quantum Era through AI-Driven Innovations

Ravi Teja Avireneni, Sri Harsha Koneru, Naresh Kiran Kumar Reddy Yelkoti +1 more

Purpose: The purpose of this paper is to examine the emerging threat that large-scale quantum computing poses to classical public-key cryptographic systems, particularly RSA and Elliptic Curve Cryptography (ECC), which form the backbone of contemporary digital security infrastructures. In response to this threat, the study aims to analyze post-quantum cryptography (PQC) as a viable long-term solution capable of resisting both classical and quantum adversaries. The paper further seeks to assess the urgency of PQC adoption in light of the “harvest now, decrypt later” threat model and to evaluate the practical readiness of quantum-safe cryptographic algorithms currently under consideration by the National Institute of Standards and Technology (NIST). Materials and Methods: This study employs a qualitative and analytical research methodology grounded in an extensive review of authoritative sources, including NIST’s post-quantum cryptography standardization documents, recent academic literature, industry white papers, and policy reports from organizations such as RAND Corporation and Cloudflare. The analysis systematically surveys major families of post-quantum cryptographic algorithms namely lattice-based, code-based, and hash-based schemes and evaluates them based on security assumptions, computational efficiency, implementation complexity, and standardization maturity. Findings: The analysis indicates that Lattice-based cryptographic schemes demonstrate the highest maturity and practical readiness, evidenced by their selection in NIST’s PQC process. Code- and hash-based methods provide strong security but face key size and performance challenges. The lack of scalable quantum computers does not reduce urgency, as data harvesting persists. Artificial intelligence emerges as a key enabler for accelerating PQC adoption. Unique Contribution to Theory, Practice and Policy: The paper recommends a proactive, phased post-quantum migration using hybrid cryptographic architectures. Organizations should conduct inventories, benchmarking, and pilot deployments aligned with NIST standards. AI-driven tools are advised to improve key management and reduce complexity. Continued interdisciplinary research and policy support are encouraged to ensure a secure, scalable transition to quantum-resistant security systems.

European Journal of Technology•Apr 17, 2024•0 citations

Counting Down to Q-Day: A Systems-Engineering Review of Quantum-Safe Cryptography Readiness in Critical Infrastructure

Krishan M I Liyanaarachchi

Every piece of critical infrastructure that relies on public-key cryptography (the power grid’s control systems, the banking sector’s settlement networks, the certificate authorities underpinning the internet) shares a single point of mathematical failure: the assumption that factoring large integers and solving discrete logarithms remains computationally intractable. A sufficiently capable quantum computer would remove that assumption. This review examines the systems-engineering gap between the cryptographic community’s response to that threat and the operational reality of critical infrastructure. The U.S. National Institute of Standards and Technology finalized its first three post-quantum cryptography standards in August 2024, and a dense web of national mandates has since converted a theoretical migration into a scheduled one. Yet the infrastructure most exposed to long-term harm from “harvest now, decrypt later” data collection is also the infrastructure least equipped to migrate quickly: operational technology with fifteen-to-thirty-year hardware lifecycles, constrained embedded devices with single-digit kilobytes of spare memory, and layered public-key infrastructures that took decades to build and cannot be swapped overnight. This paper synthesizes the standardization timeline, the harvest-now-decrypt-later threat model, sector-specific bottlenecks in energy, finance, and telecommunications, and the emerging consensus that cryptographic agility, not any single algorithm choice, is the actual deliverable that determines whether critical infrastructure is “quantum-safe” in any meaningful sense. It closes by identifying where the literature is thin: independent verification of vendor readiness claims, quantitative models of migration cost across heterogeneous OT fleets, and the absence of binding, rather than advisory, quantum-safe mandates for the private operators who run most of the world’s critical infrastructure.

•Jul 20, 2026•0 citations

Securing the Future: A Comprehensive Review of Post-Quantum Cryptography in the Modern Threat Landscape

Nodira Rustamovna Rustamova, S. Dutta

The accelerating development of quantum computing represents one of the most significant paradigm shifts in the history of information security. Cryptographic systems that currently underpin global digital infrastructure—including RSA, Diffie–Hellman, and Elliptic Curve Cryptography—rely on mathematical assumptions that collapse under quantum algorithms such as Shor’s and Grover’s. Post-Quantum Cryptography (PQC) emerges as the most viable and immediate solution to secure communications in the quantum era, offering cryptographic primitives that can be deployed on today’s classical hardware while resisting both classical and quantum attacks. This review provides a comprehensive, detailed examination of PQC, analyzing its mathematical foundations, algorithmic families, standardization progress, and deployment challenges. Special emphasis is placed on the NIST PQC standardization process, the risk posed by “harvest-now-decrypt-later” adversaries, the complexities of global cryptographic migration, and the implications for critical digital infrastructures such as cloud computing, blockchain systems, long-lifespan data archives, IoT ecosystems, and national cybersecurity. Through standalone equations, tables, and figures—including a conceptual visual provided by the user—this paper offers a complete, cohesive, and rigorous synthesis. The findings underscore that the transition to PQC is not optional but imperative, requiring coordinated scientific, governmental, and industrial effort to safeguard the digital future.

Qubahan Techno Journal•May 25, 2025•4 citations

Beyond encryption: post-quantum cryptography and the future of quantum-safe networks

Radhakrishnan Delhibabu

Introduction The rapid advancement of quantum computing presents an existential threat to the mathematical foundations of modern internet security. Fault-tolerant quantum computers are projected to reach the logical qubit scale necessary to execute Shor's algorithm by 2030–2035, threatening currently deployed public-key cryptography infrastructures. Methods We evaluate the performance metrics of integrating post-quantum cryptography (PQC), specifically the newly finalized NIST standards (FIPS 203, 204, and 205), with quantum key distribution (QKD) across communication networks. Results Our analysis demonstrates that while hybrid PQC-QKD models reduce long-term key compromise probabilities to near 0%, they introduce a 15% to 40% increase in bandwidth overhead during initial cryptographic handshakes. Discussion Given that enterprise-wide cryptographic migrations historically require 7–10 years, organizations face an immediate vulnerability window against “harvest now, decrypt later” adversaries. Ultimately, we propose a phased, cryptographically agile framework to achieve a Zero-Trust, Quantum-Safe network architecture within a 5-year implementation timeline.

Frontiers in Computer Science•Aug 27, 2026•0 citations

The Role of Quantum-Safe Cryptography in Next-Generation Security

Noah Wright, Isabella Moore

Quantum computing offers major computational advances but threatens modern public-key cryptography. Classical algorithms such as RSA, Diffie–Hellman (DH), and Elliptic Curve Cryptography (ECC) are vulnerable to quantum attacks, particularly Shor’s algorithm. As large-scale quantum capabilities emerge, post-quantum cryptography (PQC) has become essential to ensure future data confidentiality, integrity, and authentication. This paper discusses the need to replace classical cryptography, explores quantum-safe solutions, and examines challenges in large-scale migration. PQC is critical across government, critical infrastructure, finance, healthcare, telecommunications, IoT, autonomous vehicles, and 6G networks. A key concern is “harvest-now, decrypt-later” attacks, where encrypted data is stored today for future quantum decryption. The study analyzes classical cryptographic vulnerabilities and reviews major PQC families: lattice-based, hash-based, code-based, multivariate-based, and isogeny-based schemes, highlighting the ongoing NIST standardization efforts. It proposes a migration framework including quantum-readiness assessment, algorithm selection, hybrid implementation, and performance evaluation. Results show that although PQC introduces higher computational complexity, optimized implementations can support real-time applications with reasonable overhead. Among PQC approaches, lattice-based schemes appear most mature and balanced in terms of security and key size. The paper concludes that quantum-safe cryptography is a necessary evolution requiring continuous monitoring, adaptable systems, and alignment with emerging standards.

International Journal of Modern Innovations and Emerging Trends•Jan 1, 2023•0 citations
Critical infrastructure operators face a cryptographic transition unlike any in the internet's history: the mathematical problems underlying RSA and elliptic-curve cryptography, which secure the vast majority of today's key exchange and digital signatures, are efficiently solvable by a sufficiently large quantum computer running Shor's algorithm. No such machine exists yet, but the transition to quantum-safe alternatives cannot wait for one to appear, because encrypted data intercepted and stored today can be decrypted retroactively the moment a capable quantum computer does exist-a risk the field calls “harvest now, decrypt later.” This paper reviews the technical and policy literature on building quantum-safe resilience into critical infrastructure specifically, where equipment lifespans of ten to twenty years and hard real-time performance constraints make this transition materially harder than in general-purpose computing. This review examines the NIST finalized post-quantum cryptography standards, published in August 2024, following an eight-year selection process; the considerable performance and overhead burden imposed by such algorithms, with measured throughput between 150 operations per second on embedded ARM devices to over 13 million operations per second on server-class GPUs for the same algorithm; the very uncertain expert opinion timeline for when a cryptographically relevant quantum computer could exist, currently estimated at a 28 to 49 percent likelihood of appearing within ten years according to a survey of twenty-six experts in 2025; and finally, the regulatory deadlines for migration to such algorithms established in five different jurisdictions, which fall anywhere between 2030 and 2035. The key finding of this review can perhaps be stated plainly: Estimates of the time period actually required for a large organization to migrate to post-quantum cryptography, which range from twelve to fifteen years or more, are uncomfortably close to, and sometimes exceed, both the regulatory deadline and even the lower end of the threat timeline itself. With regard to critical infrastructure, this is not merely a theoretical exercise, but potentially an already overdue one.
The maturation of quantum computing hardware and algorithms has transformed what was once a theoretical concern into an active planning priority for governments, enterprises, and standards bodies. This paper assesses the current and projected threat that quantum computation poses to classical public-key cryptographic standards, namely RSA, elliptic curve cryptography (ECC), and Diffie-Hellman key exchange, all of which derive their security from mathematical problems that Shor's algorithm renders tractable on a sufficiently large fault-tolerant quantum computer. We synthesize recent hardware progress, algorithmic refinements that have substantially reduced estimated qubit requirements, and the finalization of NIST's post-quantum cryptography (PQC) standards (FIPS 203, 204, and 205) to provide an evidence-based assessment of where the field stands as of mid-2026. Particular attention is given to the widening gap between optimistic resource estimates, including a contested March 2026 claim of a thousand-fold reduction in factoring resources, and the practical reality that no existing quantum computer approaches the logical qubit counts required to threaten deployed encryption. We further examine migration challenges, including performance overhead, cryptographic agility, constraints on embedded and IoT systems, and the harvest-now-decrypt-later threat model that makes migration urgency independent of exact timeline predictions. Drawing on NIST transition guidance and recent G7 coordination targets, we argue that organizations should treat cryptographic migration as a present-tense operational requirement rather than a future contingency, regardless of unresolved disagreement among experts about when a cryptographically relevant quantum computer will exist. The paper concludes with practical recommendations for risk-based migration prioritization and identifies open research questions in cryptographic agility and quantum-resistant system design.
Purpose: The purpose of this paper is to examine the emerging threat that large-scale quantum computing poses to classical public-key cryptographic systems, particularly RSA and Elliptic Curve Cryptography (ECC), which form the backbone of contemporary digital security infrastructures. In response to this threat, the study aims to analyze post-quantum cryptography (PQC) as a viable long-term solution capable of resisting both classical and quantum adversaries. The paper further seeks to assess the urgency of PQC adoption in light of the “harvest now, decrypt later” threat model and to evaluate the practical readiness of quantum-safe cryptographic algorithms currently under consideration by the National Institute of Standards and Technology (NIST). Materials and Methods: This study employs a qualitative and analytical research methodology grounded in an extensive review of authoritative sources, including NIST’s post-quantum cryptography standardization documents, recent academic literature, industry white papers, and policy reports from organizations such as RAND Corporation and Cloudflare. The analysis systematically surveys major families of post-quantum cryptographic algorithms namely lattice-based, code-based, and hash-based schemes and evaluates them based on security assumptions, computational efficiency, implementation complexity, and standardization maturity. Findings: The analysis indicates that Lattice-based cryptographic schemes demonstrate the highest maturity and practical readiness, evidenced by their selection in NIST’s PQC process. Code- and hash-based methods provide strong security but face key size and performance challenges. The lack of scalable quantum computers does not reduce urgency, as data harvesting persists. Artificial intelligence emerges as a key enabler for accelerating PQC adoption. Unique Contribution to Theory, Practice and Policy: The paper recommends a proactive, phased post-quantum migration using hybrid cryptographic architectures. Organizations should conduct inventories, benchmarking, and pilot deployments aligned with NIST standards. AI-driven tools are advised to improve key management and reduce complexity. Continued interdisciplinary research and policy support are encouraged to ensure a secure, scalable transition to quantum-resistant security systems.
Every piece of critical infrastructure that relies on public-key cryptography (the power grid’s control systems, the banking sector’s settlement networks, the certificate authorities underpinning the internet) shares a single point of mathematical failure: the assumption that factoring large integers and solving discrete logarithms remains computationally intractable. A sufficiently capable quantum computer would remove that assumption. This review examines the systems-engineering gap between the cryptographic community’s response to that threat and the operational reality of critical infrastructure. The U.S. National Institute of Standards and Technology finalized its first three post-quantum cryptography standards in August 2024, and a dense web of national mandates has since converted a theoretical migration into a scheduled one. Yet the infrastructure most exposed to long-term harm from “harvest now, decrypt later” data collection is also the infrastructure least equipped to migrate quickly: operational technology with fifteen-to-thirty-year hardware lifecycles, constrained embedded devices with single-digit kilobytes of spare memory, and layered public-key infrastructures that took decades to build and cannot be swapped overnight. This paper synthesizes the standardization timeline, the harvest-now-decrypt-later threat model, sector-specific bottlenecks in energy, finance, and telecommunications, and the emerging consensus that cryptographic agility, not any single algorithm choice, is the actual deliverable that determines whether critical infrastructure is “quantum-safe” in any meaningful sense. It closes by identifying where the literature is thin: independent verification of vendor readiness claims, quantitative models of migration cost across heterogeneous OT fleets, and the absence of binding, rather than advisory, quantum-safe mandates for the private operators who run most of the world’s critical infrastructure.
The accelerating development of quantum computing represents one of the most significant paradigm shifts in the history of information security. Cryptographic systems that currently underpin global digital infrastructure—including RSA, Diffie–Hellman, and Elliptic Curve Cryptography—rely on mathematical assumptions that collapse under quantum algorithms such as Shor’s and Grover’s. Post-Quantum Cryptography (PQC) emerges as the most viable and immediate solution to secure communications in the quantum era, offering cryptographic primitives that can be deployed on today’s classical hardware while resisting both classical and quantum attacks. This review provides a comprehensive, detailed examination of PQC, analyzing its mathematical foundations, algorithmic families, standardization progress, and deployment challenges. Special emphasis is placed on the NIST PQC standardization process, the risk posed by “harvest-now-decrypt-later” adversaries, the complexities of global cryptographic migration, and the implications for critical digital infrastructures such as cloud computing, blockchain systems, long-lifespan data archives, IoT ecosystems, and national cybersecurity. Through standalone equations, tables, and figures—including a conceptual visual provided by the user—this paper offers a complete, cohesive, and rigorous synthesis. The findings underscore that the transition to PQC is not optional but imperative, requiring coordinated scientific, governmental, and industrial effort to safeguard the digital future.
Introduction The rapid advancement of quantum computing presents an existential threat to the mathematical foundations of modern internet security. Fault-tolerant quantum computers are projected to reach the logical qubit scale necessary to execute Shor's algorithm by 2030–2035, threatening currently deployed public-key cryptography infrastructures. Methods We evaluate the performance metrics of integrating post-quantum cryptography (PQC), specifically the newly finalized NIST standards (FIPS 203, 204, and 205), with quantum key distribution (QKD) across communication networks. Results Our analysis demonstrates that while hybrid PQC-QKD models reduce long-term key compromise probabilities to near 0%, they introduce a 15% to 40% increase in bandwidth overhead during initial cryptographic handshakes. Discussion Given that enterprise-wide cryptographic migrations historically require 7–10 years, organizations face an immediate vulnerability window against “harvest now, decrypt later” adversaries. Ultimately, we propose a phased, cryptographically agile framework to achieve a Zero-Trust, Quantum-Safe network architecture within a 5-year implementation timeline.
Quantum computing offers major computational advances but threatens modern public-key cryptography. Classical algorithms such as RSA, Diffie–Hellman (DH), and Elliptic Curve Cryptography (ECC) are vulnerable to quantum attacks, particularly Shor’s algorithm. As large-scale quantum capabilities emerge, post-quantum cryptography (PQC) has become essential to ensure future data confidentiality, integrity, and authentication. This paper discusses the need to replace classical cryptography, explores quantum-safe solutions, and examines challenges in large-scale migration. PQC is critical across government, critical infrastructure, finance, healthcare, telecommunications, IoT, autonomous vehicles, and 6G networks. A key concern is “harvest-now, decrypt-later” attacks, where encrypted data is stored today for future quantum decryption. The study analyzes classical cryptographic vulnerabilities and reviews major PQC families: lattice-based, hash-based, code-based, multivariate-based, and isogeny-based schemes, highlighting the ongoing NIST standardization efforts. It proposes a migration framework including quantum-readiness assessment, algorithm selection, hybrid implementation, and performance evaluation. Results show that although PQC introduces higher computational complexity, optimized implementations can support real-time applications with reasonable overhead. Among PQC approaches, lattice-based schemes appear most mature and balanced in terms of security and key size. The paper concludes that quantum-safe cryptography is a necessary evolution requiring continuous monitoring, adaptable systems, and alignment with emerging standards.