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

Post-Quantum Cryptography is Not Secure to Attacks with Physics Beyond the Standard Model

Trevor Nestor

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.13964.27527

Related papers

Theoretical Vulnerabilities of Post-Quantum Cryptography to (Bio)Physics Beyond the Standard Model

Trevor Nestor

•Jan 1, 2026•0 citations

Beyond Post-Quantum Cryptography: Cryptosystems that are Secure in Certain Computation Models

V. K. Zadiraka, Антон Михайлович Кудін, I. A. Kudin +1 more

Cybernetics and Systems Analysis•Nov 1, 2025•1 citation

Beyond Classical Limits

Divyajyothi M. G, Rachappa Jopate, B. Sundaravadivazhagan

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.

Wiley eBooks•Mar 7, 2025•0 citations

A Note on Quantum Security for Post-Quantum Cryptography

Fang Song

Lecture notes in computer science•Jan 1, 2014•76 citations

Selection of Post-Quantum Cryptography Algorithms for Standardization and Assessment of Their Security

S. Yu. Mikhnevich, P. I. Hladun

The process of selecting post-quantum cryptography algorithms for standardization based on parameters proposed by the National Institute of Standards and Technology (NIST) is described. The resistance of post-quantum cryptography algorithms to attacks by classical and quantum computers is assessed, taking into account their specific features. The different numbers of operations for attacks by quantum and classical computers are substantiated. The parallelization potential of post-quantum cryptography algorithms is analyzed. It is noted that, despite the proposed use of quantum computers, the primary goal of cryptography is the application of algorithms based on problems that are not reducible to problems of P-class complexity.

Doklady BGUIR•Dec 25, 2025•0 citations

Challenges of Post-Quantum Cryptography

Antonia Wachter-Zeh

•Jan 1, 2018•0 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 process of selecting post-quantum cryptography algorithms for standardization based on parameters proposed by the National Institute of Standards and Technology (NIST) is described. The resistance of post-quantum cryptography algorithms to attacks by classical and quantum computers is assessed, taking into account their specific features. The different numbers of operations for attacks by quantum and classical computers are substantiated. The parallelization potential of post-quantum cryptography algorithms is analyzed. It is noted that, despite the proposed use of quantum computers, the primary goal of cryptography is the application of algorithms based on problems that are not reducible to problems of P-class complexity.