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

IITK directions

Post-quantum Cryptography: An Introduction

Shweta Agrawal

Published Jan 1, 2020• 1 citation
Publisher
DOI
10.1007/978-981-15-1675-7_10

Related papers

Introduction to post-quantum cryptography

Daniel J. Bernstein

Springer eBooks•Jan 31, 2009•393 citations

Post-quantum Cryptography: An Overview

Syed Ismail Abdul Lathif, Priya Saxena, Priyanshi Singh

Blockchain technologies•Jan 1, 2025•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

Introduction to Quantum Computing and Post-quantum Cryptography

Douglas R. Stinson

In this chapter, we begin with a brief, mathematical introduction to quantum computing. This includes an elementary treatment of qubits, quantum gates and quantum circuits. Then we discuss two of the classic quantum algorithms that are relevant to cryptography, namely, Grover's Algorithm and Shor's Algorithm . We do not delve into the details of the algorithms; our intention is just to examine the implications of these algorithms for cryptography. In the case of Shor's Algorithm , we focus on the connections between the Discrete Logarithm Problem and Integer Factoring Problem on the one hand, and the Hidden Abelian Subgroup Problem on the other hand. We also briefly list some of the issues concerning key encapsulation mechanisms in the post-quantum setting. Finally, we describe the main approaches to post-quantum cryptography—which we discuss in more detail in later chapters—and the ongoing standardization efforts for post-quantum cryptography.

Chapman & Hall/CRC eBooks•Nov 9, 2026•0 citations

Post Quantum Cryptography: A Gentle Introduction of Lattice-Based Cryptography (Kyber, NTRUCrypto)

Parth D. Shah, Priteshkumar Prajapati, Ravi Patel +1 more

Lecture notes in networks and systems•Jan 1, 2025•2 citations

Post-Quantum Cryptography: State of the Art

Johannes A Buchmann, Denis Butin, Florian Göpfert +1 more

Lecture notes in computer science•Jan 1, 2016•65 citations
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.
In this chapter, we begin with a brief, mathematical introduction to quantum computing. This includes an elementary treatment of qubits, quantum gates and quantum circuits. Then we discuss two of the classic quantum algorithms that are relevant to cryptography, namely, Grover's Algorithm and Shor's Algorithm . We do not delve into the details of the algorithms; our intention is just to examine the implications of these algorithms for cryptography. In the case of Shor's Algorithm , we focus on the connections between the Discrete Logarithm Problem and Integer Factoring Problem on the one hand, and the Hidden Abelian Subgroup Problem on the other hand. We also briefly list some of the issues concerning key encapsulation mechanisms in the post-quantum setting. Finally, we describe the main approaches to post-quantum cryptography—which we discuss in more detail in later chapters—and the ongoing standardization efforts for post-quantum cryptography.