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.
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. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.
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 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 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.
In this paper, the contribution has been the development of a hybrid AES-ECC-Post quantum cryptography model that would bring about future-proof secure communications in response to the threat of changing and evolving classical and quantum computing. Classical cryptographic systems based on either symmetric or asymmetric systems are limited in nature regarding the management of keys, computational costs, and long-term security, especially in the face of the perceived effects of quantum attacks on commonly used public-key algorithms. In order to find solutions to these issues, the proposed model will combine the Advanced Encryption Standard (AES) to encrypt and decrypt data efficiently and fast, Elliptic Curve Cryptography (ECC) to perform lightweight authentication and compatibility, and the post-quantum cryptography primitives to establish quantum-resistant keys. The hybrid architecture will be interoperable and modular to facilitate an easy way of integrating with other existing communication infrastructures and making the migration towards post-quantum preparedness possible. Performance and security analysis show that the given solution presents a reasonable trade-off between efficiency, scalability, and cryptographic strength in the environments of clouds, enterprise, and Internet of Things (IoT). This paper will integrate classical and post-quantum methods into a single clear framework, hence, offering a deployable and practical solution to the next-generation secure communication 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.