Jul 2026· International Journal of Information Technology Research Studies (IJITRS)· Vol 2, pp. 26· 0 citations· 7 references
TL;DR
A practical migration framework for enterprises is presented, reviews the quantum threat and Mosca's inequality for timing the transition, summarizes the new standards with their key and signature sizes, and proposes a five-phase roadmap built on crypto-agility.
Abstract
Large-scale quantum computers threaten the public-key cryptography that protects enterprise data, communications, and digital identity. Shor's algorithm solves integer factorization and discrete logarithms in polynomial time, which would break RSA, Diffie-Hellman, and elliptic-curve schemes once a cryptographically relevant quantum computer exists. The danger is not only future. Adversaries can record encrypted traffic today and decrypt it later, a tactic known as harvest-now-decrypt-later. In August 2024 the U.S. National Institute of Standards and Technology published its first post-quantum standards: FIPS 203 (ML-KEM, derived from CRYSTALS-Kyber), FIPS 204 (ML-DSA, from CRYSTALS-Dilithium), and FIPS 205 (SLH-DSA, from SPHINCS+). This paper presents a practical migration framework for enterprises. It reviews the quantum threat and Mosca's inequality for timing the transition, summarizes the new standards with their key and signature sizes, and proposes a five-phase roadmap built on crypto-agility: discovery and inventory, risk prioritization, agility engineering, hybrid deployment, and validation. Performance trade-offs are analyzed using documented parameter sizes and illustrative TLS handshake figures. ML-KEM-768 carries a 1,184-byte public key against 64 bytes for an elliptic-curve key, while SPHINCS+ signatures can exceed 17 kilobytes. The work does not report a real deployment. It consolidates published parameters and field guidance into an actionable plan, and it highlights open challenges in certificate sizing, hardware support, and long-lived embedded systems.
This 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 during initial cryptographic handshakes.
R. Delhibabu· Frontiers of Computer Scienc...· 0 citations
This paper presents Project Anonymous, an open-source platform for real-time voice, video, and text communication, deployable on both web browsers and Android, built entirely on the NIST-standardized ML-KEM-1024 (FIPS 203) and ML-DSA-87 (FIPS 204) primitives. Inorder to secure from Shor’s algorithm offering a reduced p...
Muhammad Sulthan K. M, Haseena M. K.· International Conference Inn...· 0 citations
The review argues that readiness depends on protocol binding, implementation behavior, monitoring, and governance as much as on algorithm strength, and develops a deployment-readiness framework with four layers: security continuity, protocol integration, operational observability, and crypto-agility.
Yan Zhang· Applied and Computational En...· 0 citations
The engineering case for combining post-quantum cryptography (PQC) with quantum key distribution (QKD) as a strategy for securing next-generation communication infrastructure, focusing on 6G core and radio-access networks, Open RAN (O-RAN), and constrained Internet of Things (IoT) deployments is examined.
Aagnik Chakraborty· International Journal of App...· 0 citations
The proposed framework provides an approach to securing JWTs and APIs with PQC Dilithium, backed by formal guarantees, and Benchmarking results indicate that MLDSA-44 (NIST strength category 2) offers the ideal balance between performance, reliability, and quantum readiness.
Sreeja C. S. Vivin Krishnan· Journal of Intelligent Decis...· 0 citations
Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Wid...
A. Priyadarshi, Raushan Kumar, Kumar Soumya et al.· 2026 International Conferenc...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.