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

Quantum Computing-Based Cryptanalysis

Jincheng Zhang

Published Aug 31, 2026• 0 citations
Publisher
DOI
10.5281/zenodo.22205158

Related papers

Quantum cryptanalysis

Delaram Kahrobaei, Flores, Ramón, Marialaura Noce +2 more

Mathematical surveys and monographs•Jan 1, 2024•0 citations

Demonstration and Implementation of Quantum Computing in Cryptanalysis

Yiran Zhao

Quantum computing has long been a hot topic in both fields of physics and computer science. As a matter of fact, most of the earliest quantum algorithms are related to cryptology on account of its potential advantage over conventional computers. In this paper, Bernstein-Vazirani algorithm, a linear cryptanalysis method performing on quantum computers, is selected as a typical algorithm to demonstration and implementation of the quantum computing in cryptanalysis. To be specific, this study analyzes the method itself, and realizes the method with Qiskit so as to compare it with conventional methods. With the comparison, the superiority of quantum computing in certain fields as well as some current disadvantages to be dealt with are clarified. Thus, it is hoped to present the huge potential of quantum computing in its processing ability and its property of superposition beginning with the field of cryptanalysis. Besides, a direction of future improvement of the technology is also proposed. Overall, these results shed light on guiding further exploration of quantum computing.

Highlights in Science Engineering and Technology•Mar 16, 2023•0 citations

Analysis of the possibility of quantum computers and quantum computings for cryptanalysis of modern cryptosystems

Юрій Іванович Горбенко, Роман Сергійович Ганзя

The main trends of the science and technology development in the field of quantum physics and quantum calculations are considered in the paper. It has been shown that over the past few years plenty of new discoveries and achievements have been made in the field of quantum physics, all these events, anyway, had a great influence on the invention and production of quantum computers. Many communities around the world have been engaged in the development of quantum computers and some of them have achieved significant results in it by now.It is shown that using quantum algorithms of Shor and Grover, which can be fulfilled on a properly implemented quantum computer, can compromise some symmetric and asymmetric cryptosystems. The analysis results of endurance of the known block ciphers regarding the quantum cryptanalysis are given. It is also shown that some of them are not able to resist the quantum cryptanalysis method based on Grover's algorithm. The analysis of Shor's algorithm possibilities, which can significantly reduces computational costs for solving mathematical problems of endurance of modern asymmetric cryptoalgorithms, is given. Herewith, Shor's quantum algorithm diminishes the complexity of the cryptanalysis from exponential and subexponential to polynomial. In addition, the assessment of quantum computer resources is given in the paper, which are necessary for the quantum cryptanalysis concerning such cryptosystems as DSA, RSA, EC and NTRU.

Eastern-European Journal of Enterprise Technologies•Feb 5, 2014•3 citations

Quantum Computing and Cryptography

William Easttom

Springer eBooks•Dec 19, 2020•16 citations

Quantum Cryptanalysis of Affine Cipher

Mahima Mary Mathews, V. Panchami, Vishnu Ajith

Quantum Algorithms reduce the computational complexity or solve certain difficult problems that were originally impossible to solve with classical computers. Grover’s search algorithm is a Quantum computation algorithm that can find target elements from a set of unstructured data with the best possible,$O(\sqrt {N})$queries. Grover’s search Quantum circuits implemented accurately can be used to successfully search and find the keys of Symmetric ciphers. However, very few demonstrations of such practical cryptanalysis are available. In this paper, practical Quantum cryptanalysis circuits for Affine Cipher are proposed and demonstrated, that successfully break the cipher by finding the keys.

IEEE Journal on Emerging and Selected Topics in Circuits and Systems•Jul 15, 2024•4 citations

Quantum Computing and Cryptography

Chuck Easttom

Springer eBooks•Jan 1, 2022•42 citations
Quantum computing has long been a hot topic in both fields of physics and computer science. As a matter of fact, most of the earliest quantum algorithms are related to cryptology on account of its potential advantage over conventional computers. In this paper, Bernstein-Vazirani algorithm, a linear cryptanalysis method performing on quantum computers, is selected as a typical algorithm to demonstration and implementation of the quantum computing in cryptanalysis. To be specific, this study analyzes the method itself, and realizes the method with Qiskit so as to compare it with conventional methods. With the comparison, the superiority of quantum computing in certain fields as well as some current disadvantages to be dealt with are clarified. Thus, it is hoped to present the huge potential of quantum computing in its processing ability and its property of superposition beginning with the field of cryptanalysis. Besides, a direction of future improvement of the technology is also proposed. Overall, these results shed light on guiding further exploration of quantum computing.
The main trends of the science and technology development in the field of quantum physics and quantum calculations are considered in the paper. It has been shown that over the past few years plenty of new discoveries and achievements have been made in the field of quantum physics, all these events, anyway, had a great influence on the invention and production of quantum computers. Many communities around the world have been engaged in the development of quantum computers and some of them have achieved significant results in it by now.It is shown that using quantum algorithms of Shor and Grover, which can be fulfilled on a properly implemented quantum computer, can compromise some symmetric and asymmetric cryptosystems. The analysis results of endurance of the known block ciphers regarding the quantum cryptanalysis are given. It is also shown that some of them are not able to resist the quantum cryptanalysis method based on Grover's algorithm. The analysis of Shor's algorithm possibilities, which can significantly reduces computational costs for solving mathematical problems of endurance of modern asymmetric cryptoalgorithms, is given. Herewith, Shor's quantum algorithm diminishes the complexity of the cryptanalysis from exponential and subexponential to polynomial. In addition, the assessment of quantum computer resources is given in the paper, which are necessary for the quantum cryptanalysis concerning such cryptosystems as DSA, RSA, EC and NTRU.
Quantum Algorithms reduce the computational complexity or solve certain difficult problems that were originally impossible to solve with classical computers. Grover’s search algorithm is a Quantum computation algorithm that can find target elements from a set of unstructured data with the best possible,O(N)O(\sqrt {N})O(N​)queries. Grover’s search Quantum circuits implemented accurately can be used to successfully search and find the keys of Symmetric ciphers. However, very few demonstrations of such practical cryptanalysis are available. In this paper, practical Quantum cryptanalysis circuits for Affine Cipher are proposed and demonstrated, that successfully break the cipher by finding the keys.