Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Asia Pacific Conference on Innovation in Technology (APCIT)

Quantum-Resistant Cryptographic Models for Next-Gen Cybersecurity

Navin Chhibber, Amber Rastogi, Ankur Mahida, Vatsal Gupta, Piyush Ranjan

Published Sep 19, 2025• 0 citations
Publisher

Abstract

Another threat is the development of large quantum computers, which have a high likelihood of breaking the high popular security protocols because it can use both Shor and Grover algorithms. In order to fix this looming threat, quantum-resistant cryptographic systems, otherwise known as post-quantum cryptography (PQC), are being formulated to protect cybersecurity systems of the future. The current paper presents the state of the art in designing, realizing, and testing the security of robust quantum-resistant algorithms, paying attention to lattice-based, code-based, multivariate polynomial and hash-based cryptography. We discuss their resistance to classical and quantum attackers, distributed system scalability properties, and their deployment in practice (secure communications, blockchain, cloud computing infrastructures). Also, we study a hybrid cryptographic model that integrates the classical efficient cryptography scheme and a quantum-resilient cryptographic scheme to achieve a backward-compatible solution and simultaneously improving the forward security properties. With the experimental findings, it is evident that performance with reasonable computational footprint of the proposed framework succeeds to install amplified security fortitude which successfully harbours prolific cybersecurity systems of the future.

DOI
10.1109/apcit65661.2025.11410884

Related papers

Quantum-Resistant Cryptographic Models for Next-Gen Cybersecurity

Navin Chhibber, Amber Rastogi, Ankur Mahida +2 more

Another threat is the development of large quantum computers, which have a high likelihood of breaking the high popular security protocols because it can use both Shor and Grover algorithms. In order to fix this looming threat, quantum-resistant cryptographic systems, otherwise known as post-quantum cryptography (PQC), are being formulated to protect cybersecurity systems of the future. The current paper presents the state of the art in designing, realizing, and testing the security of robust quantum-resistant algorithms, paying attention to lattice-based, code-based, multivariate polynomial and hash-based cryptography. We discuss their resistance to classical and quantum attackers, distributed system scalability properties, and their deployment in practice (secure communications, blockchain, cloud computing infrastructures). Also, we study a hybrid cryptographic model that integrates the classical efficient cryptography scheme and a quantum-resilient cryptographic scheme to achieve a backward-compatible solution and simultaneously improving the forward security properties. With the experimental findings, it is evident that performance with reasonable computational footprint of the proposed framework succeeds to install amplified security fortitude which successfully harbours prolific cybersecurity systems of the future.

arXiv:2512.19005•Dec 22, 2025•0 citations

Quantum-Resistant Cryptographic Algorithms: A Comparative Analysis for Securing Next-Generation Communication Networks

Sagar Ramesh Rane

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.

Journal of Information Systems Engineering & Management•Feb 10, 2025•0 citations

Quantum-Resistant Cryptographic Protocols for Post-Quantum Secure Communications

Padma Guntupalli, M. Chandana, M. Rashi +3 more

The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC. With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks. This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as lattice-based, code-based, multivariate, hash-based, and isogeny-based cryptography. It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure. Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use. This paper proposes a scalable comparison system, which correlates the hypothetical security basis of postquantum cryptography with the ability to effectively operate in the real world. It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems. This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.

International Conference on Computing for Sustainable Global Development•Apr 8, 2026•0 citations

Quantum-Resistant Cryptographic Protocols for Post-Quantum Secure Communications

G. Shiva Parvathi, P. Akhila, T. Harshitha +3 more

The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC.With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks.This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as latticebased, code-based, multivariate, hash-based, and isogeny-based cryptography.It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure.Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use.This paper proposes a scalable comparison system, which correlates the hypothetical security basis of post-quantum cryptography with the ability to effectively operate in the real world.It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems.This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.

International Journal of Research in Advent Technology•Jun 30, 2026•0 citations

Post-Quantum Cryptography for Next-Generation Communication Networks

Daniyal Zaheer

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.

ACADEMIA Tech Frontiers Journal•Aug 11, 2025•0 citations

Post-Quantum Cryptography: Designing Secure Cryptographic Systems to Withstand the Threat of Quantum Computing Attacks

Eren Danyel Uçar

The emergence of quantum computing poses a serious threat to traditional communication systems, endangering the security of digital communications and critical infrastructure. Although existing cryptographic algorithms (such as RSA and ECC) rely on the inefficiency of computing large numbers or solving logarithm inequality problems, quantum algorithms (especially Shor's algorithm) can solve these problems efficiently. To mitigate this threat, the field of post-quantum cryptography (PQC) has emerged and focuses on developing cryptographic systems that are resilient to quantum attacks. The main techniques in PQC include lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Lattice-based cryptography is the leading contender, providing high security and supporting good properties such as fully homomorphic encryption, but facing issues related to size and computational efficiency. Hash-based encryption enables strong digital signatures but has limitations. Code-based encryption based on error-correcting codes provides proof of security but requires small size. Multivariate polynomial cryptography has good performance but has drawbacks in some applications. While standardization efforts led by organizations such as NIST continue, PQC is at the forefront of protecting the digital future from the impact of quantum computing, ensuring the integrity and confidentiality of information in the post-quantum era.

Human computer interaction.•Nov 29, 2024•0 citations
Another threat is the development of large quantum computers, which have a high likelihood of breaking the high popular security protocols because it can use both Shor and Grover algorithms. In order to fix this looming threat, quantum-resistant cryptographic systems, otherwise known as post-quantum cryptography (PQC), are being formulated to protect cybersecurity systems of the future. The current paper presents the state of the art in designing, realizing, and testing the security of robust quantum-resistant algorithms, paying attention to lattice-based, code-based, multivariate polynomial and hash-based cryptography. We discuss their resistance to classical and quantum attackers, distributed system scalability properties, and their deployment in practice (secure communications, blockchain, cloud computing infrastructures). Also, we study a hybrid cryptographic model that integrates the classical efficient cryptography scheme and a quantum-resilient cryptographic scheme to achieve a backward-compatible solution and simultaneously improving the forward security properties. With the experimental findings, it is evident that performance with reasonable computational footprint of the proposed framework succeeds to install amplified security fortitude which successfully harbours prolific cybersecurity systems of the future.
Another threat is the development of large quantum computers, which have a high likelihood of breaking the high popular security protocols because it can use both Shor and Grover algorithms. In order to fix this looming threat, quantum-resistant cryptographic systems, otherwise known as post-quantum cryptography (PQC), are being formulated to protect cybersecurity systems of the future. The current paper presents the state of the art in designing, realizing, and testing the security of robust quantum-resistant algorithms, paying attention to lattice-based, code-based, multivariate polynomial and hash-based cryptography. We discuss their resistance to classical and quantum attackers, distributed system scalability properties, and their deployment in practice (secure communications, blockchain, cloud computing infrastructures). Also, we study a hybrid cryptographic model that integrates the classical efficient cryptography scheme and a quantum-resilient cryptographic scheme to achieve a backward-compatible solution and simultaneously improving the forward security properties. With the experimental findings, it is evident that performance with reasonable computational footprint of the proposed framework succeeds to install amplified security fortitude which successfully harbours prolific cybersecurity systems of the future.
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 development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC. With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks. This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as lattice-based, code-based, multivariate, hash-based, and isogeny-based cryptography. It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure. Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use. This paper proposes a scalable comparison system, which correlates the hypothetical security basis of postquantum cryptography with the ability to effectively operate in the real world. It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems. This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.
The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC.With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks.This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as latticebased, code-based, multivariate, hash-based, and isogeny-based cryptography.It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure.Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use.This paper proposes a scalable comparison system, which correlates the hypothetical security basis of post-quantum cryptography with the ability to effectively operate in the real world.It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems.This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.
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.
The emergence of quantum computing poses a serious threat to traditional communication systems, endangering the security of digital communications and critical infrastructure. Although existing cryptographic algorithms (such as RSA and ECC) rely on the inefficiency of computing large numbers or solving logarithm inequality problems, quantum algorithms (especially Shor's algorithm) can solve these problems efficiently. To mitigate this threat, the field of post-quantum cryptography (PQC) has emerged and focuses on developing cryptographic systems that are resilient to quantum attacks. The main techniques in PQC include lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Lattice-based cryptography is the leading contender, providing high security and supporting good properties such as fully homomorphic encryption, but facing issues related to size and computational efficiency. Hash-based encryption enables strong digital signatures but has limitations. Code-based encryption based on error-correcting codes provides proof of security but requires small size. Multivariate polynomial cryptography has good performance but has drawbacks in some applications. While standardization efforts led by organizations such as NIST continue, PQC is at the forefront of protecting the digital future from the impact of quantum computing, ensuring the integrity and confidentiality of information in the post-quantum era.