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

Student Computer Science Research Conference (StuCoSReC)

The problem of quantum computers in cryptography and post-quantum cryptography

Dino Vlahek

Published Oct 1, 2010• 4 citations
Publisher
DOI
10.26493/978-961-7055-26-9.61-64

Related papers

A Study on Quantum Cryptography and Post Quantum Cryptography

Seung Min Kim, Sung Hee Lim, So-Hee Kim +1 more

Proceedings of the Korea Information Processing Society Conference•Jan 1, 2016•0 citations

Recent Developments in Post-Quantum Cryptography

Tsuyoshi Takagi

The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Dec 31, 2017•5 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

Quantum Computing and Quantum Cryptography

Simon Rubinstein‐Salzedo

Springer undergraduate mathematics series•Jan 1, 2018•0 citations

A Survey on Post-Quantum Cryptography: State-of-the-Art and Challenges

Marel Alvarado, Luke Gayler, Alex Seals +2 more

The paper explains that post-quantum cryptography is necessary due to the introduction of quantum computing causing certain algorithms to be broken. We analyze the different types of post-quantum cryptography, quantum cryptography and quantum-resistant cryptography, to provide a thorough understanding of the current solutions to the problems and their limitations. We explain the current state of quantum computing and how it has changed over time while discussing possible attacks on both types of post-quantum cryptography. Next, current post-quantum algorithms are discussed, and implementations are demonstrated. Lastly, we conclude that due to quantum cryptography's present limitations it is not a viable solution like it is often presented to be and that it is currently better to use quantum-resistant cryptography.

arXiv:2312.10430•Dec 16, 2023•16 citations

Post-quantum Cryptography: A Review on Cryptographic Solutions for the Era of Quantum Computing

Manmohan Singh, Sandeep K. Sood, Munish Bhatia

Archives of Computational Methods in Engineering•Sep 24, 2025•32 citations
The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.
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.
The paper explains that post-quantum cryptography is necessary due to the introduction of quantum computing causing certain algorithms to be broken. We analyze the different types of post-quantum cryptography, quantum cryptography and quantum-resistant cryptography, to provide a thorough understanding of the current solutions to the problems and their limitations. We explain the current state of quantum computing and how it has changed over time while discussing possible attacks on both types of post-quantum cryptography. Next, current post-quantum algorithms are discussed, and implementations are demonstrated. Lastly, we conclude that due to quantum cryptography's present limitations it is not a viable solution like it is often presented to be and that it is currently better to use quantum-resistant cryptography.