The rapid advancement of quantum computing has posed a significant threat to traditional public-key cryptographic systems, particularly those based on elliptic curve cryptography (ECC). Although ECC has long been valued for its strong classical security and computational efficiency, quantum algorithms capable of solving the elliptic curve discrete logarithm problem would render these systems vulnerable in the near future. This study investigated how secure elliptic-curve-based cryptographic systems could be redesigned for the post-quantum era by integrating post-quantum cryptographic (PQC) primitives into hybrid security architectures. A design-oriented and analytical research approach was employed to compare classical ECC, standalone PQC, and hybrid ECC–PQC models using quantitative measures of security strength, computational cost, and communication overhead. The results demonstrated that while ECC provided excellent performance, it lacked quantum resistance, whereas PQC offered strong quantum-safe security at the cost of higher computational and bandwidth requirements. The hybrid ECC–PQC approach achieved the most balanced outcome, combining high classical efficiency with robust quantum resistance and strong long-term security. Numerical performance evaluation showed that hybrid systems increased execution time and handshake size moderately compared to PQC alone, yet delivered significantly improved security guarantees. These findings confirmed that hybrid cryptographic architectures represent a practical and reliable pathway for migrating existing elliptic-curve infrastructures toward quantum-resilient security. The study contributed a mathematically grounded and deployment-oriented framework that supports secure, gradual transition strategies for protecting digital communications in a quantum-enabled future.
The rapid advancement of quantum computing has posed a significant threat to traditional public-key cryptographic systems, particularly those based on elliptic curve cryptography (ECC). Although ECC has long been valued for its strong classical security and computational efficiency, quantum algorithms capable of solving the elliptic curve discrete logarithm problem would render these systems vulnerable in the near future. This study investigated how secure elliptic-curve-based cryptographic systems could be redesigned for the post-quantum era by integrating post-quantum cryptographic (PQC) primitives into hybrid security architectures. A design-oriented and analytical research approach was employed to compare classical ECC, standalone PQC, and hybrid ECC–PQC models using quantitative measures of security strength, computational cost, and communication overhead. The results demonstrated that while ECC provided excellent performance, it lacked quantum resistance, whereas PQC offered strong quantum-safe security at the cost of higher computational and bandwidth requirements. The hybrid ECC–PQC approach achieved the most balanced outcome, combining high classical efficiency with robust quantum resistance and strong long-term security. Numerical performance evaluation showed that hybrid systems increased execution time and handshake size moderately compared to PQC alone, yet delivered significantly improved security guarantees. These findings confirmed that hybrid cryptographic architectures represent a practical and reliable pathway for migrating existing elliptic-curve infrastructures toward quantum-resilient security. The study contributed a mathematically grounded and deployment-oriented framework that supports secure, gradual transition strategies for protecting digital communications in a quantum-enabled future.
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.
The rapid advancement of quantum computing threatens the security foundations of classical public-key cryptographic systems such as RSA and Elliptic Curve Cryptography (ECC), which underpin cloud and edge infrastructures. With scalable quantum algorithms capable of breaking widely deployed cryptographic primitives, organizations must transition toward quantum-resilient security models. This paper proposes a comprehensive Quantum-Resilient Cryptographic Architecture (QRCA) designed specifically for cloud and edge computing environments. The framework integrates post-quantum cryptographic (PQC) algorithms, hybrid key exchange protocols, zero-trust principles, and hardware-assisted secure enclaves. We present a layered security model that balances computational overhead, latency constraints, and scalability requirements in distributed systems. Experimental simulations evaluate performance metrics including encryption latency, key exchange overhead, and throughput across cloud data centres and edge nodes. Results indicate that hybrid PQC deployments achieve strong quantum resilience with manageable performance trade-offs. The proposed architecture offers a practical migration pathway for organizations seeking future-proof cryptographic security in distributed computing ecosystems.
The rapid advancement of quantum computing introduces unprecedented security threats to modern cloud and edge computing infrastructures. Classical public-key cryptographic algorithms such as RSA, Diffie–Hellman, and Elliptic Curve Cryptography (ECC) are fundamentally vulnerable to quantum attacks enabled by Shor’s algorithm. As a result, the confidentiality, integrity, and authenticity of data stored and processed in distributed systems are at serious risk.Post-quantum cryptography (PQC) aims to develop cryptographic algorithms that are resistant to both classical and quantum adversaries. This paper presents a comprehensive quantum-resilient cryptographic framework designed specifically for post-quantum cloud and edge computing environments. The framework integrates post-quantum cryptographic primitives, hybrid cryptographic approaches, crypto-agile architectures, and secure key management mechanisms. The proposed framework addresses performance constraints, scalability requirements, and deployment challenges in heterogeneous environments. A detailed discussion of security threats, architectural components, performance considerations, and future research directions is provided. The proposed approach enables longterm security and supports a smooth transition toward quantum-safe distributed computing systems.
The advent of quantum computing poses a significant challenge to conventional cryptographic methods such as RSA, Elliptic Curve Cryptography (ECC), and Diffie-Hellman key exchange. Quantum algorithms, particularly Shor’s algorithm, have the potential to break these encryption techniques, making it essential to develop cryptographic approaches that can withstand quantum threats. Post-quantum cryptography (PQC) has emerged as a crucial area of research, aiming to establish cryptographic mechanisms that remain secure even in the presence of quantum adversaries. This study presents a detailed comparative analysis of five primary categories of quantum-resistant cryptographic algorithms: lattice-based, code-based, hash-based, multivariate polynomial, and isogeny-based encryption schemes. Each of these approaches offers distinct advantages and challenges in terms of security, efficiency, and implementation feasibility. Among them, lattice-based cryptography has gained significant attention due to its robust security properties and computational efficiency, making it a strong candidate for standardization. Conversely, code-based cryptography provides high security but is hindered by its large key sizes, affecting its practical deployment. The research includes a real-time performance assessment of selected PQC algorithms, analyzing key factors such as encryption speed, key size, and computational demands. Furthermore, the study examines the challenges associated with transitioning from classical encryption standards to quantum-resistant frameworks, including compatibility constraints, computational overhead, and the necessity for global standardization. Potential mitigation approaches, such as hybrid cryptographic techniques that integrate both classical and post-quantum encryption models, are also explored. Our findings emphasize that while quantum-resistant cryptography is still evolving, early adoption of PQC frameworks is essential for safeguarding future communication networks. This paper provides valuable insights for researchers, cybersecurity professionals, and policymakers on strategic measures to implement quantum-secure encryption systems effectively.
The impending arrival of large-scale quantum computers poses a significant threat to modern public-key cryptography, which is largely based on the hardness of integer factorization and the discrete logarithm problem. Elliptic Curve Cryptography (ECC), a cornerstone of current digital security, is particularly vulnerable to attacks by quantum algorithms, notably Shor's algorithm. This has catalyzed the development of Post-Quantum Cryptography (PQC), a new generation of cryptographic systems designed to be secure against both classical and quantum adversaries. Among the various PQC families, isogeny-based cryptography has emerged as a compelling, albeit complex, candidate. This paper explores the reimagination of elliptic curve principles for a post-quantum world through the lens of isogeny graphs. We provide a comprehensive overview of the transition from classical ECC to isogeny-based schemes, detailing the mathematical foundations of elliptic curve isogenies and the construction of supersingular isogeny graphs. The core of our analysis focuses on how the problem of finding a secret isogeny path between two curves in this graph forms the basis for quantum-resistant cryptographic protocols. We review the evolution of seminal protocols such as Supersingular Isogeny Diffie-Hellman (SIDH) and its variants, discussing their initial promise. Crucially, the paper also addresses the recent groundbreaking cryptanalytic attacks on SIDH, which have reshaped the landscape of isogeny-based cryptography. We analyze the implications of these attacks and the ongoing research to develop new, more secure isogeny-based schemes like SQISign. By comparing the performance metrics (key size, performance, security) of isogeny-based systems with other leading PQC candidates, such as those based on lattices and codes, this paper offers a balanced perspective on their potential role in future cryptographic standards.
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.