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

Wiley eBooks

Beyond Classical Limits

Divyajyothi M. G, Rachappa Jopate, B. Sundaravadivazhagan

Published Mar 7, 2025• 0 citations
Publisher

Abstract

As we enter the era of quantum computing, traditional cryptographic algorithms are becoming increasingly vulnerable to attacks that could compromise sensitive information. The idea of quantum physics, which enables far more efficient computation than classical computing, is what makes quantum computing possible. Although this holds great potential to transform industries like financial modeling, medicine development, and weather forecasting, it also poses a serious threat to the security of our digital infrastructure. Many of the cryptographic approaches used today rely on the difficulty of factoring large numbers or solving discrete logarithm problems. Quantum computers can perform numerous tasks far more quickly than classical computers, even if many of these methods are subject to attacks. Fortunately, post-quantum cryptography offers a possible remedy for this problem. It creates novel encryption algorithms that are immune to quantum attacks by using mathematical riddles that are believed to be difficult even for quantum computers to solve. Despite being relatively new, this field of study has the potential to transform the field of cryptography and protect our digital future. This chapter delves at the potential of post-quantum cryptography to transform the way we safeguard our digital environment. We examine the fundamental ideas and ideas in mathematics that underpin post-quantum cryptography. One of the most exciting areas of post-quantum cryptography is lattice-based cryptography. Mathematical structures called lattices have the appearance of well-organized spatial point grids. Lattice-based encryption is based on the problem of finding a short vector in a lattice, which is believed to be tough even for quantum computers. This is the basis for many post-quantum cryptography approaches. Code-based cryptography is another fascinating field of post-quantum encryption. Error-correcting codes, which are widely used in digital communication to ensure proper information delivery, constitute the foundation of this approach. Code-based cryptography relies on the difficulty of decoding a random linear code, which is believed to be resistant to quantum attacks. The primary drawback of this strategy is the huge key sizes needed, which may render it unfeasible for various applications. Another promising field of post-quantum cryptography is multivariate cryptography. Compared to other post-quantum cryptographic methods, multivariate cryptography offers the advantage of smaller key sizes, which makes it more useful in specific applications. We examine the strengths and weaknesses of these cutting-edge methods and highlight some of the challenges and limitations that must be addressed in order to fully realize the potential of post-quantum cryptography, such as the need for efficient implementation, standardization, and integration with existing systems. Although post-quantum cryptography appears to offer a viable safeguard against the risks associated with quantum computing, several challenges need to be tackled before its full potential can be achieved. One of the main challenges is standardization, which is necessary for the broad application of post-quantum cryptography methods. We also look at the real-world uses of post-quantum cryptography, such as online banking and encrypted texting. This chapter offers a thorough introduction to this fascinating area and highlights the creative solutions that are opening the door to a more secure digital future.

DOI
10.1002/9781394242399.ch14

Related papers

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

Quantum Computing and Cryptography: Security Challenges and Post-Quantum Solutions

Alok Priyadarshi, Raushan Kumar, Kumar Soumya +2 more

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.

International Conference on Secure Information Systems and Technologies (ICSIST)•Aug 1, 2026•0 citations

Cryptographic Protocols Resilient to Quantum Attacks: Advancements in Post-Quantum Cryptography

Pallavi Niraj Vithalkar

New developments in quantum computing have made people worry that current security methods could be broken by quantum attacks. Some mathematical problems are hard to solve, which is how traditional encryption methods like RSA and ECC keep their secrets safe. However, quantum computers might be able to solve these issues a lot faster than regular computers, which makes these methods less safe. Because of this threat, experts have been working hard to make post-quantum cryptography methods that quantum computers can't break. These methods are made to stand up to the strength of quantum algorithms and protect the privacy, integrity, and validity of private data even when quantum attackers are present. Lattice-based cryptography is a potential method for post-quantum encryption. Its security comes from the difficulty of certain lattice problems. Lattice-based methods are thought to be safe from threats from both traditional and quantum computers because they offer good security promises. Lattice-based cryptography is a flexible way to build different types of cryptographic primitives, like encryption, digital signatures, and key sharing protocols. The study of code-based cryptography, which is based on how hard it is to decode some error-correcting codes, is another important advance. Code-based methods have been around for a long time and have been studied a lot, which makes them a good choice for security after quantum computing. Code-based cryptography is also easy to use and has strong security features, which makes it a good choice for real-world situations. Multivariate polynomial cryptography is another possible choice for cryptography after quantum computing. The safety of this method depends on how hard it is to solve systems of multivariate polynomial problems. Multivariate polynomial methods might not be as secure as lattice-based or code-based cryptography, but they are interesting options for some situations and places with limited resources.

Communications on Applied Nonlinear Analysis•Jun 23, 2024•6 citations

Enhancing Secure Communication System Using Post-Quantum Cryptography

G. Ramalakshmi, T. Vijayalakshmi

In modern computer networks, cryptography is vital for preserving privacy, protecting sensitive information, and securing online communication. The mathematical problems that conventional encryption algorithms such as RSA and ECC depend on are tough for standard computers to tackle. Nonetheless, these traditional methods could be vulnerable to quantum assaults due to the rapid advancement of quantum computing. Post-quantum cryptography (PQC) refers to cryptographic methods designed to be secure against both classical and quantum computers. These algorithms rely on mathematical challenges believed to be resistant to quantum attacks, such as multivariate polynomial, hash, lattice, and code-based problems. This paper examines the necessity for post-quantum cryptography, the weaknesses of existing cryptographic systems, and the various categories of post-quantum algorithms.

•Jul 15, 2026•0 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

A Survey of Cryptographic Algorithms in Cybersecurity: From Classical Methods to Quantum-Resistant Solutions

Swapnali N Tambe-Jagtap

As quantum computing technology evolves, it poses greater risks to current cryptography schemes such as RSA and Elliptic Curve Cryptography (ECC), widely used to secure digital communications These classical algorithms are based on mathematical problems that quantum algorithms such as Shore-Grover deal with. Both, can resolve much faster, making them vulnerable to quantum attack This has given rise to post-quantum cryptography (PQC), which focuses on developing quantum-resistant algorithms to protect data in the future of quantum computers classical cryptography Can Break This paper aims to provide a comprehensive insight into quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariable polynomial methods. It examines the efficiency, benefits, and challenges associated with implementing these algorithms in real-world applications. By comparing key parameters such as key size, encryption/decryption speed, and signature size, this study examines the relative strengths and limitations of post-quantum algorithms to their classical counterparts The results show that lattice-based algorithms , such as NTRU and Kyber, offer promising solutions with relative efficiency and manageable key sizes, making them potential candidates for quantum-resistant cryptography but other approaches , such as SPHINCS+ (hash-based) and McEliece (code-based), large -Face challenges of key size and slow encryption speed, which may limit their usefulness in some applications Despite these challenges, quantum post-cryptography is necessary to secure the future of digital communications.

Shifra.•Jun 1, 2023•29 citations
As we enter the era of quantum computing, traditional cryptographic algorithms are becoming increasingly vulnerable to attacks that could compromise sensitive information. The idea of quantum physics, which enables far more efficient computation than classical computing, is what makes quantum computing possible. Although this holds great potential to transform industries like financial modeling, medicine development, and weather forecasting, it also poses a serious threat to the security of our digital infrastructure. Many of the cryptographic approaches used today rely on the difficulty of factoring large numbers or solving discrete logarithm problems. Quantum computers can perform numerous tasks far more quickly than classical computers, even if many of these methods are subject to attacks. Fortunately, post-quantum cryptography offers a possible remedy for this problem. It creates novel encryption algorithms that are immune to quantum attacks by using mathematical riddles that are believed to be difficult even for quantum computers to solve. Despite being relatively new, this field of study has the potential to transform the field of cryptography and protect our digital future. This chapter delves at the potential of post-quantum cryptography to transform the way we safeguard our digital environment. We examine the fundamental ideas and ideas in mathematics that underpin post-quantum cryptography. One of the most exciting areas of post-quantum cryptography is lattice-based cryptography. Mathematical structures called lattices have the appearance of well-organized spatial point grids. Lattice-based encryption is based on the problem of finding a short vector in a lattice, which is believed to be tough even for quantum computers. This is the basis for many post-quantum cryptography approaches. Code-based cryptography is another fascinating field of post-quantum encryption. Error-correcting codes, which are widely used in digital communication to ensure proper information delivery, constitute the foundation of this approach. Code-based cryptography relies on the difficulty of decoding a random linear code, which is believed to be resistant to quantum attacks. The primary drawback of this strategy is the huge key sizes needed, which may render it unfeasible for various applications. Another promising field of post-quantum cryptography is multivariate cryptography. Compared to other post-quantum cryptographic methods, multivariate cryptography offers the advantage of smaller key sizes, which makes it more useful in specific applications. We examine the strengths and weaknesses of these cutting-edge methods and highlight some of the challenges and limitations that must be addressed in order to fully realize the potential of post-quantum cryptography, such as the need for efficient implementation, standardization, and integration with existing systems. Although post-quantum cryptography appears to offer a viable safeguard against the risks associated with quantum computing, several challenges need to be tackled before its full potential can be achieved. One of the main challenges is standardization, which is necessary for the broad application of post-quantum cryptography methods. We also look at the real-world uses of post-quantum cryptography, such as online banking and encrypted texting. This chapter offers a thorough introduction to this fascinating area and highlights the creative solutions that are opening the door to a more secure digital future.
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.
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.
New developments in quantum computing have made people worry that current security methods could be broken by quantum attacks. Some mathematical problems are hard to solve, which is how traditional encryption methods like RSA and ECC keep their secrets safe. However, quantum computers might be able to solve these issues a lot faster than regular computers, which makes these methods less safe. Because of this threat, experts have been working hard to make post-quantum cryptography methods that quantum computers can't break. These methods are made to stand up to the strength of quantum algorithms and protect the privacy, integrity, and validity of private data even when quantum attackers are present. Lattice-based cryptography is a potential method for post-quantum encryption. Its security comes from the difficulty of certain lattice problems. Lattice-based methods are thought to be safe from threats from both traditional and quantum computers because they offer good security promises. Lattice-based cryptography is a flexible way to build different types of cryptographic primitives, like encryption, digital signatures, and key sharing protocols. The study of code-based cryptography, which is based on how hard it is to decode some error-correcting codes, is another important advance. Code-based methods have been around for a long time and have been studied a lot, which makes them a good choice for security after quantum computing. Code-based cryptography is also easy to use and has strong security features, which makes it a good choice for real-world situations. Multivariate polynomial cryptography is another possible choice for cryptography after quantum computing. The safety of this method depends on how hard it is to solve systems of multivariate polynomial problems. Multivariate polynomial methods might not be as secure as lattice-based or code-based cryptography, but they are interesting options for some situations and places with limited resources.
In modern computer networks, cryptography is vital for preserving privacy, protecting sensitive information, and securing online communication. The mathematical problems that conventional encryption algorithms such as RSA and ECC depend on are tough for standard computers to tackle. Nonetheless, these traditional methods could be vulnerable to quantum assaults due to the rapid advancement of quantum computing. Post-quantum cryptography (PQC) refers to cryptographic methods designed to be secure against both classical and quantum computers. These algorithms rely on mathematical challenges believed to be resistant to quantum attacks, such as multivariate polynomial, hash, lattice, and code-based problems. This paper examines the necessity for post-quantum cryptography, the weaknesses of existing cryptographic systems, and the various categories of post-quantum algorithms.
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.
As quantum computing technology evolves, it poses greater risks to current cryptography schemes such as RSA and Elliptic Curve Cryptography (ECC), widely used to secure digital communications These classical algorithms are based on mathematical problems that quantum algorithms such as Shore-Grover deal with. Both, can resolve much faster, making them vulnerable to quantum attack This has given rise to post-quantum cryptography (PQC), which focuses on developing quantum-resistant algorithms to protect data in the future of quantum computers classical cryptography Can Break This paper aims to provide a comprehensive insight into quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariable polynomial methods. It examines the efficiency, benefits, and challenges associated with implementing these algorithms in real-world applications. By comparing key parameters such as key size, encryption/decryption speed, and signature size, this study examines the relative strengths and limitations of post-quantum algorithms to their classical counterparts The results show that lattice-based algorithms , such as NTRU and Kyber, offer promising solutions with relative efficiency and manageable key sizes, making them potential candidates for quantum-resistant cryptography but other approaches , such as SPHINCS+ (hash-based) and McEliece (code-based), large -Face challenges of key size and slow encryption speed, which may limit their usefulness in some applications Despite these challenges, quantum post-cryptography is necessary to secure the future of digital communications.