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

Chapman & Hall/CRC eBooks

*Quantum-Secure Cryptography

Jonathan I. Katz, Yehuda Lindell

Published May 14, 2025• 0 citations
Publisher

Abstract

So far in this book (cf. Section 3.1.2 ), we have equated the notion of “efficient adversaries” with adversarial algorithms running in (probabilistic) polynomial-time on a classical computer . Thus, when evaluating the security of our schemes we only considered efficient classical attacks. We did not, however, consider the potential impact of quantum computers —that is, computers that rely in an essential way on the principles of quantum mechanics. As we will see here, quantum algorithms can in some cases be faster than classical algorithms—possibly much faster—and thus quantum computers can have a dramatic impact on the security of cryptosystems.

DOI
10.1201/9781003398134-14

Related papers

Security Notions for Quantum Public-Key Cryptography

Takeshi Koshiba

It is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosystems in the quantum computational setting. Moreover, we consider the security of quantum public-key cryptosystems known so far.

arXiv:quant-ph/0702183•Feb 19, 2007•13 citations

Quantum Computations and Security: Analyzing the Impact of Quantum Computing on Encryption and Security

Ivan Stefanov Stankov

The fundamental principles on which a quantum computer is built and the necessary calculations for the behavior of particles and waves are performed are those of quantum mechanics. A number of studies have outlined the potential capabilities of a quantum computer, and it is believed that it has the potential to be significantly faster than a traditional computer, especially as the input data size increases dramatically. The purpose of the research in this paper is to investigate the impact of quantum computation on encryption and security. A key question will be to evaluate how quantum computing will affect existing cryptographic methods and security systems. Possible challenges and possible solutions to address them are discussed. The research focuses on the technological aspect of quantum computing and its impact on modern encryption and security systems.

International Scientific Conference on Information, Communication and Energy Systems and Technologies (ICEST)•Jun 26, 2025•2 citations

*Post-Quantum Cryptography

Jonathan I. Katz, Yehuda Lindell

This chapter describes the impact of quantum algorithms on the schemes used today, and offers a glimpse of some schemes offering plausible post-quantum security. It introduces one computational problem that has received a lot of attention, and is widely believed to be hard even for quantum algorithms. Quantum cryptography refers to cryptosystems that are implemented using quantum computers, quantum-mechanical phenomena, and quantum communication channels; for this reason, they would be difficult to deploy widely over the existing Internet. Post-quantum cryptosystems, are entirely classical—but are intended to ensure security even if an attacker has access to a quantum computer. The chain-based signature scheme is a stateful signature scheme that is existentially unforgeable under an adaptive chosen-message attack. Quantum computing is covered in the text by Nielsen and Chuang, which also describes Grover’s algorithm and Shor’s algorithm.

Chapman & Hall/CRC eBooks•Dec 20, 2020•5 citations

Quantum Computing and Its Impact on Modern Cybersecurity and Cryptography

John Olusegun Fajinmi

The rapid advancement of quantum computing poses both transformative opportunities and profound challenges for modern cybersecurity and cryptography. Unlike classical computers, quantum systems leverage the principles of quantum mechanics-superposition, entanglement, and quantum tunneling-to process information in fundamentally new ways, enabling exponentially faster computation for certain problems. This paradigm shift threatens to render many of today's widely adopted cryptographic algorithms obsolete, particularly those relying on the hardness of integer factorization (e.g., RSA) and discrete logarithms (e.g., ECC and DSA). Quantum algorithms, such as Shor's algorithm, have the potential to break these cryptosystems in polynomial time, exposing sensitive data to unprecedented levels of vulnerability. Additionally, Grover's algorithm accelerates brute-force attacks on symmetric encryption schemes, reducing their effective security strength by half. This paper explores the implications of quantum computing on current cryptographic infrastructures, highlighting the urgency for transitioning to quantum-resistant or postquantum cryptographic algorithms. It examines emerging standards from bodies such as NIST, which are fostering the development and evaluation of lattice-based, codebased, multivariate polynomial, and hash-based cryptographic solutions. Furthermore, the study delves into the dual-edged nature of quantum computing in cybersecuritydiscussing its potential not only as a threat but also as a powerful tool for enhancing security through quantum key distribution (QKD), quantum random number generation, and other quantum-enhanced protocols. The work concludes by evaluating the readiness of current systems for the "quantum threat," identifying gaps in awareness, infrastructure, and policy, and proposing a strategic roadmap for a secure transition into the post-quantum era. As the quantum revolution accelerates, understanding and preparing for its cybersecurity ramifications is not merely a technical necessity but a cornerstone of global digital resilience.

•Apr 16, 2025•1 citation

Security Against Attacks to Cryptographic Algorithms by Quantum Computer – And Why Multiple Different Solutions Are Needed

Stefan Röhrich

This work describes and compares different ways to protect your systems against attacks by quantum computers. The comparison is done from a security and an implementation point of view.

NATO science for peace and security series. D, Information and communication security•Feb 19, 2024•0 citations

Post-Quantum Cryptography Beyond Computational Security

T. Attema, Nicole Gervasoni, M.J.H. Marcus +1 more

The advent of a full-scale quantum computer will severely impact most currently-used cryptographic systems.The most well-known aspect of this impact lies in the computational-hardness assumptions that underpin the security of most current public-key cryptographic systems: a quantum computer can factor integers and compute discrete logarithms in polynomial time, thereby breaking systems based on these problems.However, simply replacing these problems by other which are (believed to be) impervious even to a quantum computer does not completely solve the issue.Indeed, many security proofs of cryptographic systems are no longer valid in the presence of a quantum-capable attacker; while this does not automatically implies that the affected systems would be broken by a quantum computer, it does raises questions on the exact security guarantees that they can provide.This overview document aims to analyze all aspects of the impact of quantum computers on cryptographic, by providing an overview of current quantum-hard computational problems (and cryptographic systems based on them), and by presenting the security proofs that are affected by quantum-attackers, detailing what is the current status of research on the topic and what the expected effects on security are.

•Jan 1, 2021•0 citations
So far in this book (cf. Section 3.1.2 ), we have equated the notion of “efficient adversaries” with adversarial algorithms running in (probabilistic) polynomial-time on a classical computer . Thus, when evaluating the security of our schemes we only considered efficient classical attacks. We did not, however, consider the potential impact of quantum computers —that is, computers that rely in an essential way on the principles of quantum mechanics. As we will see here, quantum algorithms can in some cases be faster than classical algorithms—possibly much faster—and thus quantum computers can have a dramatic impact on the security of cryptosystems.
It is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosystems in the quantum computational setting. Moreover, we consider the security of quantum public-key cryptosystems known so far.
The fundamental principles on which a quantum computer is built and the necessary calculations for the behavior of particles and waves are performed are those of quantum mechanics. A number of studies have outlined the potential capabilities of a quantum computer, and it is believed that it has the potential to be significantly faster than a traditional computer, especially as the input data size increases dramatically. The purpose of the research in this paper is to investigate the impact of quantum computation on encryption and security. A key question will be to evaluate how quantum computing will affect existing cryptographic methods and security systems. Possible challenges and possible solutions to address them are discussed. The research focuses on the technological aspect of quantum computing and its impact on modern encryption and security systems.
This chapter describes the impact of quantum algorithms on the schemes used today, and offers a glimpse of some schemes offering plausible post-quantum security. It introduces one computational problem that has received a lot of attention, and is widely believed to be hard even for quantum algorithms. Quantum cryptography refers to cryptosystems that are implemented using quantum computers, quantum-mechanical phenomena, and quantum communication channels; for this reason, they would be difficult to deploy widely over the existing Internet. Post-quantum cryptosystems, are entirely classical—but are intended to ensure security even if an attacker has access to a quantum computer. The chain-based signature scheme is a stateful signature scheme that is existentially unforgeable under an adaptive chosen-message attack. Quantum computing is covered in the text by Nielsen and Chuang, which also describes Grover’s algorithm and Shor’s algorithm.
The rapid advancement of quantum computing poses both transformative opportunities and profound challenges for modern cybersecurity and cryptography. Unlike classical computers, quantum systems leverage the principles of quantum mechanics-superposition, entanglement, and quantum tunneling-to process information in fundamentally new ways, enabling exponentially faster computation for certain problems. This paradigm shift threatens to render many of today's widely adopted cryptographic algorithms obsolete, particularly those relying on the hardness of integer factorization (e.g., RSA) and discrete logarithms (e.g., ECC and DSA). Quantum algorithms, such as Shor's algorithm, have the potential to break these cryptosystems in polynomial time, exposing sensitive data to unprecedented levels of vulnerability. Additionally, Grover's algorithm accelerates brute-force attacks on symmetric encryption schemes, reducing their effective security strength by half. This paper explores the implications of quantum computing on current cryptographic infrastructures, highlighting the urgency for transitioning to quantum-resistant or postquantum cryptographic algorithms. It examines emerging standards from bodies such as NIST, which are fostering the development and evaluation of lattice-based, codebased, multivariate polynomial, and hash-based cryptographic solutions. Furthermore, the study delves into the dual-edged nature of quantum computing in cybersecuritydiscussing its potential not only as a threat but also as a powerful tool for enhancing security through quantum key distribution (QKD), quantum random number generation, and other quantum-enhanced protocols. The work concludes by evaluating the readiness of current systems for the "quantum threat," identifying gaps in awareness, infrastructure, and policy, and proposing a strategic roadmap for a secure transition into the post-quantum era. As the quantum revolution accelerates, understanding and preparing for its cybersecurity ramifications is not merely a technical necessity but a cornerstone of global digital resilience.
The advent of a full-scale quantum computer will severely impact most currently-used cryptographic systems.The most well-known aspect of this impact lies in the computational-hardness assumptions that underpin the security of most current public-key cryptographic systems: a quantum computer can factor integers and compute discrete logarithms in polynomial time, thereby breaking systems based on these problems.However, simply replacing these problems by other which are (believed to be) impervious even to a quantum computer does not completely solve the issue.Indeed, many security proofs of cryptographic systems are no longer valid in the presence of a quantum-capable attacker; while this does not automatically implies that the affected systems would be broken by a quantum computer, it does raises questions on the exact security guarantees that they can provide.This overview document aims to analyze all aspects of the impact of quantum computers on cryptographic, by providing an overview of current quantum-hard computational problems (and cryptographic systems based on them), and by presenting the security proofs that are affected by quantum-attackers, detailing what is the current status of research on the topic and what the expected effects on security are.