The need for a post-quantum Internet is emerging, and this is a great opportunity to re-examine the legacy of public key infrastructure. There is a need for perspective on the evolution of cryptography over the years, including the perfect information theoretical secure schemes and the computationally secure schemes, in particular. There is also a need to examine the evolved Internet infrastructure to identify and design efficient and secure cryptographic schemes over the existing Internet infrastructure. A combination of overlay security, Blockchain, and Merkle trees with Lamport’s signatures implies such an easily implementable post quantum Internet.
The need for a post-quantum Internet is emerging, and this is a great opportunity to re-examine the legacy of public key infrastructure. There is a need for perspective on the evolution of cryptography over the years, including the perfect information theoretical secure schemes and the computationally secure schemes, in particular. There is also a need to examine the evolved Internet infrastructure to identify and design efficient and secure cryptographic schemes over the existing Internet infrastructure. A combination of overlay security, Blockchain, and Merkle trees with Lamport’s signatures implies such an easily implementable post quantum Internet.
The need for a quantum-safe Internet is emerging, and this is a great opportunity to re-examine the legacy of public key infrastructure. There is a need for perspective on the evolution of cryptography over the years, including the perfect information-theoretical secure schemes and the computationally secure schemes, in particular. There is also a need to examine the evolving Internet infrastructure to identify efficient design and secure cryptographic schemes over the existing Internet infrastructure. A combination of overlay security, blockchain, and Merkle trees with Lamport’s signatures offers just such an easily implementable quantum-safe Internet.
The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.
Large-scale quantum computers, once realized, threaten the mathematical foundations on which today’s public-key infrastructure is built. Widely deployed schemes such as RSA and Elliptic Curve Cryptography depend on number-theoretic problems that quantum algorithms are expected to solve effi-ciently, motivating a decade-long effort to design cryptographic primitives that resist both classical and quantum adversaries. This survey brings together that effort under a single lens, tracing the reasoning behind post-quantum cryptography (PQC) from its theoretical origins to its practical deployment. We begin by clarifying why quantum computation undermines classical hardness assumptions, then walk through the four major PQC families – lattice-based, code-based, hash-based, and multivariate constructions – weighing each against the others on security assurance, computational cost, and ease of implementation. The discussion then turns outward to where PQC is actually being tested: Internet of Things deployments, blockchain ledgers, and AI-assisted defense pipelines, drawing on recent proposals in each area. We close by consolidating the recurring obstacles reported across this literature – oversized keys, added computational burden, and friction with legacy protocols – into a set of concrete directions for researchers aiming to make quantum-resistant security practical rather than merely theoretical.
While advances in quantum computing promise new opportunities for scientific advancement (e.g., material science and machine learning), many people are not aware that they also threaten the widely deployed cryptographic algorithms that are the foundation of today's digital security and privacy. From mobile communications to online banking to personal data privacy, literally billions of Internet users rely on cryptography every day to ensure that private communications and data stay private. Indeed, the emergence and growth of the public Internet and electronic commerce was arguably enabled by the invention of public-key cryptography. The key advantage offered by public-key cryptography is that it allows two parties who have never communicated previously to nevertheless establish a secure, private, communication channel over a non-private network (e.g., the Internet). Recent advances in quantum computing signal that we are on the cusp of our next cryptographic algorithm transition, and this transition to post-quantum cryptography will be more complicated and impact many more systems and stakeholders, than any of the prior migrations. This transition represents a major disruption within the IT industry and will broadly impact nearly every domain of our digital lives, from global commerce to social media to government and more. Cryptographic algorithm transitions take time and involve an extensive coordination effort across many stakeholders who are involved in building and operating the world's compute infrastructure. By preparing now for the upcoming transition to these new algorithms, we can ensure a more orderly, less costly, and minimally disruptive changeover.
The rapid advancement of quantum computing poses a critical threat to classical cryptographic schemes that secure modern distributed systems. As the deployment of distributed infrastructures—including blockchains, cloud-native applications, and edge networks—continues to grow, there is an urgent need to transition towards quantum-resistant security mechanisms. This paper provides a comprehensive examination of post-quantum cryptographic (PQC) algorithms and their applicability in distributed system architectures. We analyze the impact of quantum threats on key components of distributed systems such as communication protocols, identity management, data integrity, and consensus mechanisms. Furthermore, we evaluate current NIST-standardized PQC algorithms in terms of computational efficiency, scalability, and integration overhead within distributed environments. Challenges in key management, performance trade-offs, and implementation considerations are discussed. Finally, we propose best practices and future directions for secure, quantum-resilient distributed systems.
The potential of the swift development of quantum computing is an extreme danger to the traditional cryptographic programs, and they are the foundation of the modern communication infrastructure. RSA and ECC are classical public-key algorithms that can be successfully quantum-attacked, in particular, Shor's algorithm can easily factor large integers and calculate discrete logarithms (Bernstein et al., 2017). The Post-Quantum Cryptography (PQC) has become the key to secure the next-generation communication networks against these threats, which relies on lattice problem-based algorithms, hash-based based algorithms, multivariate polynomials-based algorithms, and code-based cryptography. The paper examines the concepts, design, and implementation issues of PQC within current network infrastructure focusing on the secure transmission of data, authentication, and key management in the upcoming 5G and 6G networks. The approach will include the survey of existing algorithms of PQC, model the integration of protocol in the communication systems and test computational efficiency, security strength, and scalability. It has been found that PQC is suitable to protect network communications against quantum attackers, and achieves reasonable performance, though trade-offs can be seen in terms of computation overhead, key size, and latency. The research offers understanding to the researcher, network engineers and policy makers in order to adopt quantum resistant cryptography protocols to secure the confidentiality, integrity and authenticity of information in the future communication networks.