Authors :
Ramya; Rashmi
Volume/Issue :
Volume 11 - 2026, Issue 7 - July
Google Scholar :
https://tinyurl.com/mr7hdute
Scribd :
https://tinyurl.com/ysen775m
DOI :
https://doi.org/10.38124/ijisrt/26jul1288
Note : A published paper may take 4-5
working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and
ResearchGate.
Abstract :
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.
Keywords :
Post-Quantum Cryptography, Quantum Computing, Shor's Algorithm, RSA, Elliptic Curve Cryptography, ML-KEM, ML-DSA, NIST, Cryptographic Migration, Harvest-Now-Decrypt-Later.
References :
- C. Gidney, "How to factor 2048 bit RSA integers with fewer than one million noisy qubits," arXiv preprint, 2025.
- Google Quantum AI, "Reducing the cost of breaking elliptic-curve cryptography with quantum computers," Google Research Blog, Mar. 31, 2026.
- Caltech-Berkeley-Oratomic Collaboration, "Neutral-atom architectures for resource-efficient implementation of Shor's algorithm," arXiv preprint, Mar. 2026.
- National Institute of Standards and Technology, "NIST releases first 3 finalized post-quantum encryption standards," NIST News, Aug. 13, 2024.
- Authors, "Securing cryptography in the age of quantum computing and AI: Threats, implementations, and strategic response," arXiv preprint arXiv:2603.06969, 2026.
- Authors, "Towards quantum-resistant trusted computing: Architectures for post-quantum integrity verification techniques," arXiv preprint arXiv:2601.11095, 2026.
- C. Gidney and M. Ekera, "How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits," Quantum, vol. 5, p. 433, 2021.
- National Institute of Standards and Technology, "NIST IR 8547 (Initial Public Draft): Transition to post-quantum cryptography standards," Nov. 2024.
- Quantum Zeitgeist, "Cryptographically relevant quantum computer: Complete 2026 guide," 2026.
- ScienceAlert, "Quantum computers could break encryption far sooner than we realized," Apr. 13, 2026.
- The Conversation, "Quantum computers are coming to break our codes faster than anyone expected," Apr. 12, 2026.
- Advanced Quantum Technologies Institute, "AQTI announces JVG algorithm for efficient integer factorization," Press Release via PR Newswire, Mar. 2, 2026.
- Diplotic, "Fact check: Are quantum computers now breaking RSA encryption?," Mar. 17, 2026.
- Global Risk Institute, "Quantum threat timeline report," Annual Expert Survey, 2026.
- A. Gautam, "Quantum computers just got 1,000x more efficient at breaking RSA: Developers have less time than they think," Mar. 5, 2026.
- CNN, "Quantum computing threatens to unleash a cybersecurity crisis," May 17, 2026.
- IBM Newsroom, "IBM-developed algorithms announced as NIST's first published post-quantum cryptography standards," PR Newswire, Aug. 13, 2024.
- National Institute of Standards and Technology, "Module-Lattice-Based Key-Encapsulation Mechanism Standard," Federal Information Processing Standards Publication 203, Aug. 2024.
- Sectigo, "NIST's official 2024 post-quantum algorithms," Sectigo Resources, 2025.
- Authors, "Towards quantum-resistant trusted computing," arXiv preprint arXiv:2601.11095, 2026.
- National Institute of Standards and Technology, "NIST IR 8547 (ipd): Transition to post-quantum cryptography standards," Sec. 4.2, Nov. 2024.
- Authors, "Securing cryptography in the age of quantum computing and AI," arXiv preprint arXiv:2603.06969, 2026.
- Palo Alto Networks, "What are NIST PQC standards?," Cyberpedia, 2025.
- National Institute of Standards and Technology, "NIST IR 8547 (ipd): Transition to post-quantum cryptography standards," migration sequencing section, Nov. 2024.
- National Institute of Standards and Technology, "NIST IR 8547 (Initial Public Draft): Transition to post-quantum cryptography standards," Nov. 2024.
26. G7 Cyber Expert Group, "G7 coordination statement on post-quantum cryptographic migration," Jan. 2026.
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.
Keywords :
Post-Quantum Cryptography, Quantum Computing, Shor's Algorithm, RSA, Elliptic Curve Cryptography, ML-KEM, ML-DSA, NIST, Cryptographic Migration, Harvest-Now-Decrypt-Later.