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 Pune Section International Conference (PuneCon)

A study on Post Quantum- Recent Techniques, Challenges and Bibliometric analysis

Pranav Joshi, Amit Saxena

Published Dec 13, 2024• 0 citations
Publisher

Abstract

The advent of quantum computers spells doom for classical encryption schemes. Asymmetric key cryptosystems are easily solved by quantum computers using Shor’s algorithm and Grover’s algorithm in polynomial time compared to exponential time for classical brute forcing techniques. Therefore, current encryption schemes are easily decrypted by quantum computing technologies. This indicates a paradigm shift in the field of cryptography and necessitates the development of quantum resistant algorithms. Therefore, the field of post-quantum cryptography is vital to protect sensitive data, which includes grave matters of national security. Thus, this work highlights the need of accelerating the impactful research on quantum resistant cryptosystems along with a bibliometric study showcasing present research output. Moreover, throws light on the state-of-the-art quantum resistant algorithms along with their methodologies and challenges (in particular, the NIST finalists) and suggests future work needed to safeguard matters of public safety and national security.

DOI
10.1109/punecon63413.2024.10895634

Related papers

Post Quantum Cryptography: Techniques, Challenges, Standardization, and Directions for Future Research

Ritik Bavdekar, Eashan Jayant Chopde, Ashutosh Bhatia +3 more

The development of large quantum computers will have dire consequences for cryptography. Most of the symmetric and asymmetric cryptographic algorithms are vulnerable to quantum algorithms. Grover's search algorithm gives a square root time boost for the searching of the key in symmetric schemes like AES and 3DES. The security of asymmetric algorithms like RSA, Diffie Hellman, and ECC is based on the mathematical hardness of prime factorization and discrete logarithm. The best classical algorithms available take exponential time. Shor's factoring algorithm can solve the problems in polynomial time. Major breakthroughs in quantum computing will render all the present-day widely used asymmetric cryptosystems insecure. This paper analyzes the vulnerability of the classical cryptosystems in the context of quantum computers discusses various post-quantum cryptosystem families, discusses the status of the NIST post-quantum cryptography standardization process, and finally provides a couple of future research directions in this field.

arXiv:2202.02826•Feb 6, 2022•61 citations

Post‐Quantum Cryptography Methods

M. Kundalakesi, M. Renuka Devi

The rise of powerful quantum computers casts a long shadow over the world of cryptography. Traditional encryption methods, both symmetrical and asymmetrical, are facing an existential crisis. Algorithms like Grover's search pose a significant threat to symmetric systems like AES and 3DES, dramatically accelerating key discovery. Asymmetric algorithms, like RSA, Diffie–Hellman, and ECC, rely on the inherent difficulty of factoring large numbers and solving discrete logarithms. While classical algorithms struggle with these problems, Shor's factoring algorithm, designed for quantum computers, can solve them efficiently. This impending obsolescence of current cryptographic systems necessitates a proactive search for new solutions—post-quantum cryptography. This new era of cryptography demands a deep exploration of various post-quantum cryptosystem families. National and international organizations, like the NIST (National Institute of Standards and Technology) in the US, are actively involved in the standardization process for these new encryption methods. The urgency to develop and implement post-quantum cryptography stems from the inherent vulnerabilities of classical encryption systems when faced with the brute force of quantum computing. However, the story does not end there. The future holds the potential for a powerful synergy between the immense computational power of quantum computers and the strategic decision-making capabilities of artificial intelligence. By combining these two revolutionary technologies, industries can unlock a new level of optimization, innovation, and efficiency. This future, however, hinges on securing our communication channels with robust post-quantum cryptography, ensuring a safe and secure foundation for this technological leap forward.

Wiley eBooks•Mar 7, 2025•4 citations

Post-Quantum Cryptography: Preparing for the Quantum Computing Era

Dr. Raj Kumar Garg

Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.

•Aug 12, 2026•0 citations

Post Quantum Cryptography: A Review of Techniques, Challenges and Standardizations

Ritik Bavdekar, Eashan Jayant Chopde, Ankit Agrawal +2 more

The development of large quantum computers will have dire consequences for cryptography. Most of the symmetric and asymmetric cryptographic algorithms are vulnerable to quantum algorithms. Grover’s search algorithm gives a square root time boost for the searching of the key in symmetric schemes like AES and 3DES. The security of asymmetric algorithms like RSA, Diffie Hellman, and ECC is based on the mathematical hardness of prime factorization and discrete logarithms. The best classical algorithms available take exponential time. Shor’s factoring algorithm can solve the problems in polynomial time. Major breakthroughs in quantum computing will render all the present-day widely used asymmetric cryptosystems insecure. This paper analyzes the vulnerability of the classical cryptosystems in the context of quantum computers, discusses various post-quantum cryptosystem families, discusses the status of the NIST post-quantum cryptography standardization process, provides a performance comparison of post-quantum cryptography (PQC) algorithms on different platforms, and finally provides a couple of future research directions in this field.

International Conference on Information Networking•Jan 11, 2023•138 citations

Post-Quantum Cryptography: Evaluating and Standardizing Quantum-Resistant Algorithms

Godwin Olaoye

The advent of quantum computing poses a significant threat to current cryptographic systems, particularly public-key algorithms such as RSA and ECC, which are vulnerable to quantum attacks like Shor's algorithm. Post-Quantum Cryptography (PQC) aims to develop and standardize quantum-resistant cryptographic algorithms to secure digital communications in the quantum era. This paper examines the current landscape of PQC, focusing on the evaluation and standardization efforts led by organizations such as the National Institute of Standards and Technology (NIST). We analyze the major families of quantum-resistant algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptography, discussing their security guarantees, performance trade-offs, and implementation challenges. Furthermore, we review NIST's PQC standardization process, highlighting selected finalists and alternate candidates, and explore the ongoing transition challenges in adopting these algorithms across industries. Finally, we discuss future directions for PQC research, including hybrid cryptographic systems and the need for continued cryptanalysis to ensure long-term security. This work provides a comprehensive overview of the progress and challenges in deploying quantum-resistant cryptography to safeguard against emerging quantum threats.

•Apr 9, 2025•2 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
The advent of quantum computers spells doom for classical encryption schemes. Asymmetric key cryptosystems are easily solved by quantum computers using Shor’s algorithm and Grover’s algorithm in polynomial time compared to exponential time for classical brute forcing techniques. Therefore, current encryption schemes are easily decrypted by quantum computing technologies. This indicates a paradigm shift in the field of cryptography and necessitates the development of quantum resistant algorithms. Therefore, the field of post-quantum cryptography is vital to protect sensitive data, which includes grave matters of national security. Thus, this work highlights the need of accelerating the impactful research on quantum resistant cryptosystems along with a bibliometric study showcasing present research output. Moreover, throws light on the state-of-the-art quantum resistant algorithms along with their methodologies and challenges (in particular, the NIST finalists) and suggests future work needed to safeguard matters of public safety and national security.
The development of large quantum computers will have dire consequences for cryptography. Most of the symmetric and asymmetric cryptographic algorithms are vulnerable to quantum algorithms. Grover's search algorithm gives a square root time boost for the searching of the key in symmetric schemes like AES and 3DES. The security of asymmetric algorithms like RSA, Diffie Hellman, and ECC is based on the mathematical hardness of prime factorization and discrete logarithm. The best classical algorithms available take exponential time. Shor's factoring algorithm can solve the problems in polynomial time. Major breakthroughs in quantum computing will render all the present-day widely used asymmetric cryptosystems insecure. This paper analyzes the vulnerability of the classical cryptosystems in the context of quantum computers discusses various post-quantum cryptosystem families, discusses the status of the NIST post-quantum cryptography standardization process, and finally provides a couple of future research directions in this field.
The rise of powerful quantum computers casts a long shadow over the world of cryptography. Traditional encryption methods, both symmetrical and asymmetrical, are facing an existential crisis. Algorithms like Grover's search pose a significant threat to symmetric systems like AES and 3DES, dramatically accelerating key discovery. Asymmetric algorithms, like RSA, Diffie–Hellman, and ECC, rely on the inherent difficulty of factoring large numbers and solving discrete logarithms. While classical algorithms struggle with these problems, Shor's factoring algorithm, designed for quantum computers, can solve them efficiently. This impending obsolescence of current cryptographic systems necessitates a proactive search for new solutions—post-quantum cryptography. This new era of cryptography demands a deep exploration of various post-quantum cryptosystem families. National and international organizations, like the NIST (National Institute of Standards and Technology) in the US, are actively involved in the standardization process for these new encryption methods. The urgency to develop and implement post-quantum cryptography stems from the inherent vulnerabilities of classical encryption systems when faced with the brute force of quantum computing. However, the story does not end there. The future holds the potential for a powerful synergy between the immense computational power of quantum computers and the strategic decision-making capabilities of artificial intelligence. By combining these two revolutionary technologies, industries can unlock a new level of optimization, innovation, and efficiency. This future, however, hinges on securing our communication channels with robust post-quantum cryptography, ensuring a safe and secure foundation for this technological leap forward.
Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.
The development of large quantum computers will have dire consequences for cryptography. Most of the symmetric and asymmetric cryptographic algorithms are vulnerable to quantum algorithms. Grover’s search algorithm gives a square root time boost for the searching of the key in symmetric schemes like AES and 3DES. The security of asymmetric algorithms like RSA, Diffie Hellman, and ECC is based on the mathematical hardness of prime factorization and discrete logarithms. The best classical algorithms available take exponential time. Shor’s factoring algorithm can solve the problems in polynomial time. Major breakthroughs in quantum computing will render all the present-day widely used asymmetric cryptosystems insecure. This paper analyzes the vulnerability of the classical cryptosystems in the context of quantum computers, discusses various post-quantum cryptosystem families, discusses the status of the NIST post-quantum cryptography standardization process, provides a performance comparison of post-quantum cryptography (PQC) algorithms on different platforms, and finally provides a couple of future research directions in this field.
The advent of quantum computing poses a significant threat to current cryptographic systems, particularly public-key algorithms such as RSA and ECC, which are vulnerable to quantum attacks like Shor's algorithm. Post-Quantum Cryptography (PQC) aims to develop and standardize quantum-resistant cryptographic algorithms to secure digital communications in the quantum era. This paper examines the current landscape of PQC, focusing on the evaluation and standardization efforts led by organizations such as the National Institute of Standards and Technology (NIST). We analyze the major families of quantum-resistant algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptography, discussing their security guarantees, performance trade-offs, and implementation challenges. Furthermore, we review NIST's PQC standardization process, highlighting selected finalists and alternate candidates, and explore the ongoing transition challenges in adopting these algorithms across industries. Finally, we discuss future directions for PQC research, including hybrid cryptographic systems and the need for continued cryptanalysis to ensure long-term security. This work provides a comprehensive overview of the progress and challenges in deploying quantum-resistant cryptography to safeguard against emerging quantum threats.
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.