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

Progress in Quantum Computational Cryptography

Akinori Kawachi, Takeshi Koshiba

Published Jan 1, 2006• 4 citations
Publisher

Abstract

Abstract: Shor’s algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. From the computational point of view, his algorithms illustrate that quantum computation could be more powerful. It is natural to consider that the power of quantum computation could be exploited to withstand even quantum adversaries. Over the last decade, quantum cryptography has been discussed and developed even from the computational complexity-theoretic point of view. In this paper, we will survey what has been studied in quantum computational cryptography. Key Words: computational cryptography, quantum computing, quantum cryptography Category: E.3, F.1.1

DOI
10.3217/jucs-012-06-0691

Related papers

QUANTUM CRYPTANALYSIS

Amos R Anu Gowda

The advent of quantum computing poses an existential threat to classical cryptographic systems. Shor’s algorithm (1994) can factor large integers and compute discrete logarithms in polynomial time, breaking widely used schemes like RSA, ECC, and Diffie-Hellman. This paper surveys the state-of-the-art in quantum cryptanalysis, examining its impact on symmetric and asymmetric cryptography, recent progress in quantum attacks, and defenses via post-quantum cryptography (PQC). We analyze key quantum algorithms (Shor’s, Grover’s), their real-world feasibility given current hardware (NISQ-era limitations), and emerging PQC standards (NIST’s CRYSTALS-Kyber, Dilithium). We also discuss novel attack vectors (e.g., hybrid quantum-classical cryptanalysis) and future research directions.

Archives The Journal of the British Records Association•Jul 31, 2025•0 citations

Quantum computers and their impact on public-key cryptography

Marina V. Lushnikova

The aim of this thesis is to study quantum computers and their impact on public-key cryptography. Crucial part of the work is dedicated to theoretical basis and definitions necessary for understanding the basic principles of quantum computers. The further chapters describe Shor's algorithm, explain the part of integer factoring problem in the security of current public key cryptographic algorithms, and show how to break the most widely used assymetric algorithm RSA by means of effective factoring. Last chapter provides comparison of classical factoring algorithms with Shors algorithm, mentions cryptography resistant to quantum computer attacks and discusses the current state of development in the field of qunatum computing. The conclusion summarizes both potential and real impact of quantum computers on public-key cryptography.

•Jan 1, 2014•0 citations

QUANTUM COMPUTING FOR CRYPTOGRAPHY: EXPLORING THE FUTURE OF SECURE COMMUNICATIONS WITH QUANTUM ALGORITHMS

Arslan Nadeem, Aiman Shabbir

Quantum computing holds an enormous power to transform cryptography because it protects secured communication. RSA together with elliptic curve cryptography functions based on mathematical challenges like integer factorization and discrete logarithms until quantum computers present security risks to these traditional systems. Such problems become solvable with efficiency through Shor's algorithm running on quantum computers which threatens the security of multiple widely used cryptographic protocols. The document examines quantum computing effects on cryptography to explain why quantum algorithms break classic cryptographic system security. Post-quantum cryptography (PQC) acts as a protective solution against quantum-based attacks through its mission to create cryptographic techniques which demonstrate quantum attack resilience. This paper examines quantum-age security design protocols for cryptographic keys using both quantum key distribution and lattice-based cryptography and hash-based cryptography and multivariate polynomial cryptography. The research analyzes the effectiveness and protective capability of new PQC solutions by connecting theoretical concepts with practical applications. The study points out advancements in quantum cryptography as well as the quantum hardware obstacles and the global initiative to establish post-quantum algorithms standards. The authors stress the urgent need for up-to-date quantum-resistant measures because of swift quantum technology progress. The protection of sensitive materials and communications networks from destructive quantum computing threats requires immediate focus because this need drives the necessity of properly preparing for post-quantum cryptography.

Journal of Engineering Education and Practice•Dec 31, 2023•0 citations

EXPLORING THE IMPACT OF QUANTUM COMPUTING ON CRYPTOGRAPHIC ALGORITHMS

Noman Shakeel, Farah Batool

The emergence of quantum computing poses significant challenges and opportunities in the realm of cryptography. Traditional cryptographic algorithms, such as RSA and ECC (Elliptic Curve Cryptography), rely on the computational difficulty of certain mathematical problems, like factoring large integers and solving discrete logarithms. However, quantum computers leverage quantum mechanics to solve these problems in polynomial time, which could render many of today’s encryption techniques obsolete. This article examines the potential impact of quantum computing on modern cryptographic algorithms and explores quantum-safe cryptography alternatives that are being developed to withstand quantum attacks. We also discuss the readiness of quantum computers for real-world applications, their current limitations, and the future directions of quantum cryptography research.

International Journal of Computational and Biological Sciences•Nov 22, 2025•0 citations

Quantum Computing: Potential Impacts on Cryptography and Data Security

Dharma Raj Ojha

Quantum computing introduces a new paradigm that brings about, by its very nature, revolutionary changes in cryptography and data security. This section will shortly discuss some of the impacts of quantum computing technologies on cryptographic protocols, focusing on the various vulnerabilities introduced by algorithms such as Shor's algorithm, capable of solving some problems-integer factorization and discrete logarithms-provided that polynomial complexity is achieved on quantum computers. Quantum algorithms will soon render traditional cryptographic techniques using RSA and ECC vulnerable, hence the development need for PQC techniques. It purports to analyze the available research and discusses the development, challenges, and future directions of quantum- resistant cryptographic methodologies. This paper emphasizes that transitioning towards PQC is urgent to maintain all attributes of data, such as confidentiality, integrity, and authentication in the quantum computing era. QKD emerges as a promising approach that uses the principles of quantum mechanics to provide physical-layer security for communication channels. Based on these phases, the paper develops into recommendations on building resilience in cryptography with the prospect of quantum computing.

Journal of Durgalaxmi•Dec 31, 2024•1 citation

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
Abstract: Shor’s algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. From the computational point of view, his algorithms illustrate that quantum computation could be more powerful. It is natural to consider that the power of quantum computation could be exploited to withstand even quantum adversaries. Over the last decade, quantum cryptography has been discussed and developed even from the computational complexity-theoretic point of view. In this paper, we will survey what has been studied in quantum computational cryptography. Key Words: computational cryptography, quantum computing, quantum cryptography Category: E.3, F.1.1
The advent of quantum computing poses an existential threat to classical cryptographic systems. Shor’s algorithm (1994) can factor large integers and compute discrete logarithms in polynomial time, breaking widely used schemes like RSA, ECC, and Diffie-Hellman. This paper surveys the state-of-the-art in quantum cryptanalysis, examining its impact on symmetric and asymmetric cryptography, recent progress in quantum attacks, and defenses via post-quantum cryptography (PQC). We analyze key quantum algorithms (Shor’s, Grover’s), their real-world feasibility given current hardware (NISQ-era limitations), and emerging PQC standards (NIST’s CRYSTALS-Kyber, Dilithium). We also discuss novel attack vectors (e.g., hybrid quantum-classical cryptanalysis) and future research directions.
The aim of this thesis is to study quantum computers and their impact on public-key cryptography. Crucial part of the work is dedicated to theoretical basis and definitions necessary for understanding the basic principles of quantum computers. The further chapters describe Shor's algorithm, explain the part of integer factoring problem in the security of current public key cryptographic algorithms, and show how to break the most widely used assymetric algorithm RSA by means of effective factoring. Last chapter provides comparison of classical factoring algorithms with Shors algorithm, mentions cryptography resistant to quantum computer attacks and discusses the current state of development in the field of qunatum computing. The conclusion summarizes both potential and real impact of quantum computers on public-key cryptography.
Quantum computing holds an enormous power to transform cryptography because it protects secured communication. RSA together with elliptic curve cryptography functions based on mathematical challenges like integer factorization and discrete logarithms until quantum computers present security risks to these traditional systems. Such problems become solvable with efficiency through Shor's algorithm running on quantum computers which threatens the security of multiple widely used cryptographic protocols. The document examines quantum computing effects on cryptography to explain why quantum algorithms break classic cryptographic system security. Post-quantum cryptography (PQC) acts as a protective solution against quantum-based attacks through its mission to create cryptographic techniques which demonstrate quantum attack resilience. This paper examines quantum-age security design protocols for cryptographic keys using both quantum key distribution and lattice-based cryptography and hash-based cryptography and multivariate polynomial cryptography. The research analyzes the effectiveness and protective capability of new PQC solutions by connecting theoretical concepts with practical applications. The study points out advancements in quantum cryptography as well as the quantum hardware obstacles and the global initiative to establish post-quantum algorithms standards. The authors stress the urgent need for up-to-date quantum-resistant measures because of swift quantum technology progress. The protection of sensitive materials and communications networks from destructive quantum computing threats requires immediate focus because this need drives the necessity of properly preparing for post-quantum cryptography.
The emergence of quantum computing poses significant challenges and opportunities in the realm of cryptography. Traditional cryptographic algorithms, such as RSA and ECC (Elliptic Curve Cryptography), rely on the computational difficulty of certain mathematical problems, like factoring large integers and solving discrete logarithms. However, quantum computers leverage quantum mechanics to solve these problems in polynomial time, which could render many of today’s encryption techniques obsolete. This article examines the potential impact of quantum computing on modern cryptographic algorithms and explores quantum-safe cryptography alternatives that are being developed to withstand quantum attacks. We also discuss the readiness of quantum computers for real-world applications, their current limitations, and the future directions of quantum cryptography research.
Quantum computing introduces a new paradigm that brings about, by its very nature, revolutionary changes in cryptography and data security. This section will shortly discuss some of the impacts of quantum computing technologies on cryptographic protocols, focusing on the various vulnerabilities introduced by algorithms such as Shor's algorithm, capable of solving some problems-integer factorization and discrete logarithms-provided that polynomial complexity is achieved on quantum computers. Quantum algorithms will soon render traditional cryptographic techniques using RSA and ECC vulnerable, hence the development need for PQC techniques. It purports to analyze the available research and discusses the development, challenges, and future directions of quantum- resistant cryptographic methodologies. This paper emphasizes that transitioning towards PQC is urgent to maintain all attributes of data, such as confidentiality, integrity, and authentication in the quantum computing era. QKD emerges as a promising approach that uses the principles of quantum mechanics to provide physical-layer security for communication channels. Based on these phases, the paper develops into recommendations on building resilience in cryptography with the prospect of quantum computing.
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.