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

IEEE Access

A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography

Fábio Borges, Paulo Ricardo Reis, Diogo Augusto Barros Pereira

Published Jan 1, 2020• 81 citations
Publisher

Abstract

Nowadays, we are surrounded by devices collecting and transmitting private information. Currently, the two main mathematical problems that guarantee security on the Internet are the Integer Factorization Problem and the Discrete Logarithm Problem. However, Shor's quantum algorithm can easily solve both problems. Therefore, research into cryptographic algorithms that run in classical computers and are resistant to quantum computers is extremely necessary. This area is known as post-quantum cryptography and usually studies asymmetric cryptography. By means of asymptotic analysis, the purpose of this paper is to provide an evaluation of security and its performance for the types of cryptographic systems considered safe against quantum attacks in the second-round NIST Post-Quantum Standardization Process, namely isogeny cryptosystems based on supersingular elliptic curves, error correction code-based encryption system, and lattice-based ring learning with errors. We performed a security comparison of Key Agreements protocols based on these three post-quantum cryptographic primitives and compared them with Discrete Logarithm Problem and Integer Factorization Problem. The comparison of security and its performance is presented by security level, the former by complexity analyses to achieve theoretical minimum key sizes, and the latter by simulation to assess a practical performance comparison. In the complexity analysis, as we increase the security level and then the size of the cryptographic keys increases, techniques based on isogeny outperform all other post-quantum algorithms in relation to key sizes at practical security level. In the performance comparison, the results show that the code-based protocol presents the best results among the others.

DOI
10.1109/access.2020.3013250

Related papers

From Integer Factorization to Lattices: A Post-Quantum Paradigm for Asymmetric Cryptography

Revista, Zen, MATH, 10

The advent of quantum computing poses a significant threat to the security of current asymmetric cryptographic systems, which underpin much of modern digital communication and security. These systems, predominantly RSA and Elliptic Curve Cryptography (ECC), rely on the computational hardness of mathematical problems such as integer factorization and the discrete logarithm problem. Shor's algorithm, a quantum algorithm, demonstrates the ability to efficiently solve these problems, rendering classical public-key cryptography vulnerable to attacks by sufficiently powerful quantum computers. This paper argues for and thoroughly examines the strategic imperative of transitioning from these classical cryptographic foundations to a new paradigm based on lattices, which are believed to be resistant to quantum attacks. We delve into the fundamental mathematical problems underlying lattice-based cryptography, such as the Shortest Vector Problem (SVP) and the Learning With Errors (LWE) problem, whose worst-case hardness is leveraged to achieve cryptographic security. A comprehensive literature review is provided, tracing the evolution of quantum threats and the emergence of lattice-based schemes. The methodology details the construction principles of prominent lattice-based cryptosystems. Results demonstrate their theoretical security against quantum adversaries and highlight their practical attributes, including compact key sizes and competitive performance. The discussion section contextualizes lattice-based cryptography within the broader landscape of post-quantum candidates, examining their strengths, weaknesses, and the ongoing standardization efforts by organizations like NIST. We conclude that lattice-based cryptography offers a robust and promising foundation for building resilient asymmetric cryptographic systems in the post-quantum era, ensuring the long-term security of digital information through a necessary re-architecture of cryptographic primitives.

•Nov 25, 2025•0 citations

Post-Quantum Cryptography for Secure Communication: A Systematic Review of Algorithms, Performance Trade-offs, and Emerging Challenges

Suvhodip Saha

The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.

International Journal for Research in Applied Science and Engineering Technology•Mar 24, 2026•0 citations

A comparative analysis of post-quantum cryptographic schemes over discrete algebraic structures for enhanced information security in large-scale networks

Suhail Javed Quraishi, Dharm Raj, Danish Ather +3 more

Abstractly, the fast development of quantum computing is a threat to classical public-key cryptographic infrastructures.Asymmetric algorithms (which are widely used and include RSA and Elliptic Curve Cryptography (ECC)) are susceptible to the Shor algorithm, which can break them in a time-polynomial manner.This paper will give a detailed comparative study of Post-Quantum Cryptography (PQC) schemes founded on discrete algebraic structures such as lattice-based, code-based, hash-based, and multivariate polynomials based cryptosystems.These paradigms are systematically assessed according to computational complexity, key and ciphertext sizes, security reduction assumptions, and how they can be deployed on large scale networks.The NIST-standardized algorithms, which are the focus of our analysis, are ML-KEM (CRYSTALS-Kyber), ML-DSA (CRYSTALS Dilithium), FN-DSA (Falcon), and SLH-DSA (SPHINCS+).We also consider hybrid cryptography transitional measures to provide backward compatibility and security guarantee in the process of migrating the classical to quantum-resistant systems.As we found, the current state of lattice-based schemes provides the most desirable ratio of security to performance in large-scale applications, although, in the long run, code-based and multivariate schemes are necessary as their complements.

Journal of Discrete Mathematical Sciences and Cryptography•Sep 30, 2026•1 citation

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

Post Quantum Cryptography (PQC): Securing Data In The Age Of Quantum Computers

P. Ganga Bhavani, P. Nandini Lakshmi, V. Jahnavi +2 more

The emergence of quantum computing is a serious threat to the principles of modern crypto-logical mathematics. The classical public-key cryptography, including Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Diffie-Hellman are very safe against classical adversaries yet become susceptible to quantum algorithms, including the Shor algorithm, which can easily solve the underlying mathematical problems. This weakness is jeopardizing confidentiality and integrity of the world-wide systems of communication, money transactions, and essential structures, and requires the immediate creation of safe alternatives. The current literature on post-quantum cryptography (PQC) has covered various classes of algorithm, such as lattice-based, code-based, multivariate schemes, and isogeny-based schemes. Although lattice-based approaches like Nth Degree Truncated Polynomial Ring Unit (NTRU) and FrodoKEM can be highly theoretically resistant, they can be computationally and memory-intensive. Cryptosystems based on code such as Classic McEliece are secure but not practicable because they have huge public key sizes. Multivariate schemes like Rainbow, and isogeny-based schemes like Super singular Isogeny Key Encapsulation (SIKE) have been attacked recently by cryptanalytic attacks, and broken completely. Such restrictions open the necessity to find more efficient and secure quantum-resistant solutions.This research study postulates a hybrid post-quantum cryptographic (PQC) system that combines CRYSTALS-Kyber for encryption with CRYSTALS-Dilithium for digital signatures both of which are approved through the National Institute of Standards and Technology (NIST) PQC standardization program. The model will be such that it ensures quantum resistance but at the same time it will be scalable, efficient and compatible with the existing infrastructures. The test outcomes indicate that the hybrid PQC model is 35-45 percent faster to encrypt and decrypt, signature performance is enhanced by up to 40 percent, and the throughput is 20 times higher (98.7 Mbps) than the same base PQC scheme including Nth Degree Truncated Polynomial Ring Unit (NTRU), McEliece and Rainbow. These enhancements affirm that the suggested model provides a viable trade-off between the security, speed, and efficiency in terms of key size, which makes it a viable and a sound base to ensure secure communication in the quantum age.

International Journal of Science Engineering and Technology•May 26, 2026•0 citations

Post-Quantum Cryptographic Algorithm: A systematic review of round-2 candidates.

Augustine Chidiebere Onuora, C.E. Madubuike, Anthony Obogo Otiko +1 more

The rise of the new paradigm (Quantum computing) in the recent years have created a major security challenge to classical and widely used primitive cryptography schemes such as ECC (Elliptic Curve Cryptography) and RSA (Rivest-Shamir-Adleman) Algorithm. These classical computing algorithms depend on the problems of discrete logarithm and integer factorization respectively. Recent advancements in quantum computing have made encryption schemes more vulnerable since they are weak to some quantum attacks, like Shor’s Algorithm and Grove’s Algorithm. Therefore the call for a new set of algorithms known as Post-Quantum cryptography (PQC) that would not be vulnerable to quantum attacks is imminent. NIST haven selected some candidates in the second round of Post-Quantum Cryptographic algorithms standardization project. This work’s goal is to review these algorithms under there types. A rigorous survey on each Post-Quantum Cryptography schemes and their underlying properties will be x-rayed while recommending areas for research in this new security paradigm.

•Jan 1, 2020•0 citations
Nowadays, we are surrounded by devices collecting and transmitting private information. Currently, the two main mathematical problems that guarantee security on the Internet are the Integer Factorization Problem and the Discrete Logarithm Problem. However, Shor's quantum algorithm can easily solve both problems. Therefore, research into cryptographic algorithms that run in classical computers and are resistant to quantum computers is extremely necessary. This area is known as post-quantum cryptography and usually studies asymmetric cryptography. By means of asymptotic analysis, the purpose of this paper is to provide an evaluation of security and its performance for the types of cryptographic systems considered safe against quantum attacks in the second-round NIST Post-Quantum Standardization Process, namely isogeny cryptosystems based on supersingular elliptic curves, error correction code-based encryption system, and lattice-based ring learning with errors. We performed a security comparison of Key Agreements protocols based on these three post-quantum cryptographic primitives and compared them with Discrete Logarithm Problem and Integer Factorization Problem. The comparison of security and its performance is presented by security level, the former by complexity analyses to achieve theoretical minimum key sizes, and the latter by simulation to assess a practical performance comparison. In the complexity analysis, as we increase the security level and then the size of the cryptographic keys increases, techniques based on isogeny outperform all other post-quantum algorithms in relation to key sizes at practical security level. In the performance comparison, the results show that the code-based protocol presents the best results among the others.
The advent of quantum computing poses a significant threat to the security of current asymmetric cryptographic systems, which underpin much of modern digital communication and security. These systems, predominantly RSA and Elliptic Curve Cryptography (ECC), rely on the computational hardness of mathematical problems such as integer factorization and the discrete logarithm problem. Shor's algorithm, a quantum algorithm, demonstrates the ability to efficiently solve these problems, rendering classical public-key cryptography vulnerable to attacks by sufficiently powerful quantum computers. This paper argues for and thoroughly examines the strategic imperative of transitioning from these classical cryptographic foundations to a new paradigm based on lattices, which are believed to be resistant to quantum attacks. We delve into the fundamental mathematical problems underlying lattice-based cryptography, such as the Shortest Vector Problem (SVP) and the Learning With Errors (LWE) problem, whose worst-case hardness is leveraged to achieve cryptographic security. A comprehensive literature review is provided, tracing the evolution of quantum threats and the emergence of lattice-based schemes. The methodology details the construction principles of prominent lattice-based cryptosystems. Results demonstrate their theoretical security against quantum adversaries and highlight their practical attributes, including compact key sizes and competitive performance. The discussion section contextualizes lattice-based cryptography within the broader landscape of post-quantum candidates, examining their strengths, weaknesses, and the ongoing standardization efforts by organizations like NIST. We conclude that lattice-based cryptography offers a robust and promising foundation for building resilient asymmetric cryptographic systems in the post-quantum era, ensuring the long-term security of digital information through a necessary re-architecture of cryptographic primitives.
The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.
Abstractly, the fast development of quantum computing is a threat to classical public-key cryptographic infrastructures.Asymmetric algorithms (which are widely used and include RSA and Elliptic Curve Cryptography (ECC)) are susceptible to the Shor algorithm, which can break them in a time-polynomial manner.This paper will give a detailed comparative study of Post-Quantum Cryptography (PQC) schemes founded on discrete algebraic structures such as lattice-based, code-based, hash-based, and multivariate polynomials based cryptosystems.These paradigms are systematically assessed according to computational complexity, key and ciphertext sizes, security reduction assumptions, and how they can be deployed on large scale networks.The NIST-standardized algorithms, which are the focus of our analysis, are ML-KEM (CRYSTALS-Kyber), ML-DSA (CRYSTALS Dilithium), FN-DSA (Falcon), and SLH-DSA (SPHINCS+).We also consider hybrid cryptography transitional measures to provide backward compatibility and security guarantee in the process of migrating the classical to quantum-resistant systems.As we found, the current state of lattice-based schemes provides the most desirable ratio of security to performance in large-scale applications, although, in the long run, code-based and multivariate schemes are necessary as their complements.
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 emergence of quantum computing is a serious threat to the principles of modern crypto-logical mathematics. The classical public-key cryptography, including Rivest-Shamir-Adleman (RSA), Elliptic Curve Cryptography (ECC), and Diffie-Hellman are very safe against classical adversaries yet become susceptible to quantum algorithms, including the Shor algorithm, which can easily solve the underlying mathematical problems. This weakness is jeopardizing confidentiality and integrity of the world-wide systems of communication, money transactions, and essential structures, and requires the immediate creation of safe alternatives. The current literature on post-quantum cryptography (PQC) has covered various classes of algorithm, such as lattice-based, code-based, multivariate schemes, and isogeny-based schemes. Although lattice-based approaches like Nth Degree Truncated Polynomial Ring Unit (NTRU) and FrodoKEM can be highly theoretically resistant, they can be computationally and memory-intensive. Cryptosystems based on code such as Classic McEliece are secure but not practicable because they have huge public key sizes. Multivariate schemes like Rainbow, and isogeny-based schemes like Super singular Isogeny Key Encapsulation (SIKE) have been attacked recently by cryptanalytic attacks, and broken completely. Such restrictions open the necessity to find more efficient and secure quantum-resistant solutions.This research study postulates a hybrid post-quantum cryptographic (PQC) system that combines CRYSTALS-Kyber for encryption with CRYSTALS-Dilithium for digital signatures both of which are approved through the National Institute of Standards and Technology (NIST) PQC standardization program. The model will be such that it ensures quantum resistance but at the same time it will be scalable, efficient and compatible with the existing infrastructures. The test outcomes indicate that the hybrid PQC model is 35-45 percent faster to encrypt and decrypt, signature performance is enhanced by up to 40 percent, and the throughput is 20 times higher (98.7 Mbps) than the same base PQC scheme including Nth Degree Truncated Polynomial Ring Unit (NTRU), McEliece and Rainbow. These enhancements affirm that the suggested model provides a viable trade-off between the security, speed, and efficiency in terms of key size, which makes it a viable and a sound base to ensure secure communication in the quantum age.
The rise of the new paradigm (Quantum computing) in the recent years have created a major security challenge to classical and widely used primitive cryptography schemes such as ECC (Elliptic Curve Cryptography) and RSA (Rivest-Shamir-Adleman) Algorithm. These classical computing algorithms depend on the problems of discrete logarithm and integer factorization respectively. Recent advancements in quantum computing have made encryption schemes more vulnerable since they are weak to some quantum attacks, like Shor’s Algorithm and Grove’s Algorithm. Therefore the call for a new set of algorithms known as Post-Quantum cryptography (PQC) that would not be vulnerable to quantum attacks is imminent. NIST haven selected some candidates in the second round of Post-Quantum Cryptographic algorithms standardization project. This work’s goal is to review these algorithms under there types. A rigorous survey on each Post-Quantum Cryptography schemes and their underlying properties will be x-rayed while recommending areas for research in this new security paradigm.