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

Highlights in Science Engineering and Technology

Demonstration and Implementation of Quantum Computing in Cryptanalysis

Yiran Zhao

Published Mar 16, 2023• 0 citations
Publisher

Abstract

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.

DOI
10.54097/hset.v38i.5855

Related papers

Quantum differential cryptanalysis based on Bernstein-Vazirani algorithm

Rong-Xue Xu, Hongwei Sun, Kejia Zhang +2 more

Abstract Recent research has demonstrated the potential of quantum algorithms to exploit vulnerabilities in various popular constructions, such as certain block ciphers like Feistel, Even-Mansour, and multiple MACs, within the superposition query model. In this study, we delve into the security of block ciphers against quantum threats, particularly investigating their susceptibility to cryptanalysis techniques, notably exploring quantum adaptations of differential cryptanalysis. Initially, we introduce a BV-based quantum algorithm for identifying linear structures with a complexity of $O(n)$ O ( n ) , where n denotes the number of bits in the function. Subsequently, we illustrate the application of this algorithm in devising quantum differential cryptanalysis techniques, including quantum differential cryptanalysis, quantum small probability differential cryptanalysis, and quantum impossible differential cryptanalysis, demonstrating polynomial acceleration compared to prior approaches. By treating the encryption function as a unified entity, our algorithm circumvents the traditional challenge of extending differential paths in differential cryptanalysis.

EPJ Quantum Technology•Dec 1, 2024•9 citations

Comparisons of Conventional Computing and Quantum Computing Approaches

Qiyu Liu

Quantum computers are capable of ultra fast computation in the fields where classical computers fail. Even though quantum computers are nowhere near commercialization, many researchers have developed quantum algorithms in fields such as modern encryption and molecular simulation, which, in theory, are exponentially faster than their classical counterparts. In this case, this paper will discuss the advantages of quantum computers over classical computers in those fields by examining and analyzing the various quantum algorithms. To be specific, the develop routine as well as detail examples will be exhibited to illustrate the differences and preferences. In addition, this study will also fully aware of the challenges that quantum computing researchers are facing. On this basis, possible limitations of quantum computers are also presented. The aim is to promote interest in quantum computing by introducing their supremacy in modern encryption and biological science. These results shed light on guiding further exploration of quantum computing algorithms.

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

Analysis of the possibilities and peculiarities of programming cryptology problems on a quantum computer

Yevhenii Kaptol, І.Д. Горбенко

This paper is devoted to detailing the possibilities and features of quantum computer use for cryptological problems, their demonstration, justification of approaches to the possibilities analysis and studying features of cryptanalysis problems programming on quantum computers. The possibilities and availability of hardware for solving cryptanalysis problems through quantum methods are analyzed and existing restrictions of their use are determined. The quantum computer and quantum computer programming features are considered. The possibilities of quantum computer use for cryptanalysis are also considered with the Grover’s method example. The essence of Grover’s method and features of its application for cryptanalysis are given. An example of its application to the search space which is represented by a quantum register of 56 qubits is given as well. The quantum computer application of Grover’s method on quantum computer accessible through a loud service is considered. Schemes for conducting a search by Grover's method for quantum computer application are developed, containing a different number of Grover iterations to study the need for executing a full cycle, the possibility to stop and evaluate search results at a certain stage. The developed circuits are tested on quantum computers with different architectures and on a quantum simulator provided for the analysis of circuits intended to run on a quantum computer. The comparison of the expected and obtained results of the Grover’s method application at different search stages on quantum computer is given.

Radiotekhnika•Sep 16, 2020•5 citations

A quantum related-key attack based on Bernstein-Vazirani algorithm

Huiqin Xie, Li Yang

Due to the powerful computing capability of quantum computers, cryptographic researchers have applied quantum algorithms to cryptanalysis and obtained many interesting results in recent years. In this paper, we study related-key attack in the quantum setting, and proposed a specific related-key attack which can recover the key of block ciphers efficiently, as long as the attacked block ciphers satisfy certain conditions. The attack algorithm employs Bernstein-Vazirani algorithm as a subroutine and requires the attacker to query the encryption oracle with quantum superpositions. Afterwards, we rigorously demonstrate the validity of the attack and analyze its complexity. Our work shows that related-key attack is quite powerful when combined with quantum algorithms, and provides some guidance for the design of block ciphers that are secure against quantum adversaries.

arXiv:1808.03266•Aug 9, 2018•2 citations

Algorithm efficiency and hybrid applications of quantum computing

Ruohan Yang, Zijun Zhong

With the development of science and technology, it is difficult for traditional computers to solve cutting-edge problems due to the lack of computing power, and the importance of quantum computers is increasing day by day. This article starts with the simple principle of quantum computing, introduces the most advanced quantum computing instruments and quantum computing algorithms, and points out the application prospects in medicine, chemistry and other fields. This paper explains the basic principles of quantum computing algorithms, their efficiency over traditional algorithms, and focuses on the Shor algorithm and its’ variations. In terms of applications, the quantum computer Zu Chongzhi and its contribution to the sampling problem of quantum random circuits are introduced. This paper makes a certain analysis of the limitations of quantum computing, and gives the future development goals in a targeted manner. Besides, we summarize popular quantum computing algorithms and applications, and make contributions to the promotion and development of quantum computing. Overall, these results shed light on guiding further exploration of how to improve the computational efficiency of quantum computers.

Theoretical and Natural Science•Nov 16, 2023•0 citations

Quantum impossible differential and truncated differential cryptanalysis

Huiqin Xie, Li Yang

Traditional cryptography is suffering a huge threat from the development of quantum computing. While many currently used public-key cryptosystems would be broken by Shor's algorithm, the effect of quantum computing on symmetric ones is still unclear. The security of symmetric ciphers relies heavily on the development of cryptanalytic tools. Thus, in order to accurately evaluate the security of symmetric primitives in the post-quantum world, it is significant to improve classical cryptanalytic methods using quantum algorithms. In this paper, we focus on two variants of differential cryptanalysis: truncated differential cryptanalysis and impossible differential cryptanalysis. Based on the fact that Bernstein-Vazirani algorithm can be used to find the linear structures of Boolean functions, we propose two quantum algorithms that can be used to find high-probability truncated differentials and impossible differentials of block ciphers, respectively. We rigorously prove the validity of the algorithms and analyze their complexity. Our algorithms treat all rounds of the reduced cipher as a whole and only concerns the input and output differences at its both ends, instead of specific differential characteristics. Therefore, to a certain extent, they alleviate the weakness of conventional differential cryptanalysis, namely the difficulties in finding differential characteristics as the number of rounds increases.

arXiv:1712.06997•Dec 18, 2017•5 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.
Abstract Recent research has demonstrated the potential of quantum algorithms to exploit vulnerabilities in various popular constructions, such as certain block ciphers like Feistel, Even-Mansour, and multiple MACs, within the superposition query model. In this study, we delve into the security of block ciphers against quantum threats, particularly investigating their susceptibility to cryptanalysis techniques, notably exploring quantum adaptations of differential cryptanalysis. Initially, we introduce a BV-based quantum algorithm for identifying linear structures with a complexity of O(n)O(n)O(n) O ( n ) , where n denotes the number of bits in the function. Subsequently, we illustrate the application of this algorithm in devising quantum differential cryptanalysis techniques, including quantum differential cryptanalysis, quantum small probability differential cryptanalysis, and quantum impossible differential cryptanalysis, demonstrating polynomial acceleration compared to prior approaches. By treating the encryption function as a unified entity, our algorithm circumvents the traditional challenge of extending differential paths in differential cryptanalysis.
Quantum computers are capable of ultra fast computation in the fields where classical computers fail. Even though quantum computers are nowhere near commercialization, many researchers have developed quantum algorithms in fields such as modern encryption and molecular simulation, which, in theory, are exponentially faster than their classical counterparts. In this case, this paper will discuss the advantages of quantum computers over classical computers in those fields by examining and analyzing the various quantum algorithms. To be specific, the develop routine as well as detail examples will be exhibited to illustrate the differences and preferences. In addition, this study will also fully aware of the challenges that quantum computing researchers are facing. On this basis, possible limitations of quantum computers are also presented. The aim is to promote interest in quantum computing by introducing their supremacy in modern encryption and biological science. These results shed light on guiding further exploration of quantum computing algorithms.
This paper is devoted to detailing the possibilities and features of quantum computer use for cryptological problems, their demonstration, justification of approaches to the possibilities analysis and studying features of cryptanalysis problems programming on quantum computers. The possibilities and availability of hardware for solving cryptanalysis problems through quantum methods are analyzed and existing restrictions of their use are determined. The quantum computer and quantum computer programming features are considered. The possibilities of quantum computer use for cryptanalysis are also considered with the Grover’s method example. The essence of Grover’s method and features of its application for cryptanalysis are given. An example of its application to the search space which is represented by a quantum register of 56 qubits is given as well. The quantum computer application of Grover’s method on quantum computer accessible through a loud service is considered. Schemes for conducting a search by Grover's method for quantum computer application are developed, containing a different number of Grover iterations to study the need for executing a full cycle, the possibility to stop and evaluate search results at a certain stage. The developed circuits are tested on quantum computers with different architectures and on a quantum simulator provided for the analysis of circuits intended to run on a quantum computer. The comparison of the expected and obtained results of the Grover’s method application at different search stages on quantum computer is given.
Due to the powerful computing capability of quantum computers, cryptographic researchers have applied quantum algorithms to cryptanalysis and obtained many interesting results in recent years. In this paper, we study related-key attack in the quantum setting, and proposed a specific related-key attack which can recover the key of block ciphers efficiently, as long as the attacked block ciphers satisfy certain conditions. The attack algorithm employs Bernstein-Vazirani algorithm as a subroutine and requires the attacker to query the encryption oracle with quantum superpositions. Afterwards, we rigorously demonstrate the validity of the attack and analyze its complexity. Our work shows that related-key attack is quite powerful when combined with quantum algorithms, and provides some guidance for the design of block ciphers that are secure against quantum adversaries.
With the development of science and technology, it is difficult for traditional computers to solve cutting-edge problems due to the lack of computing power, and the importance of quantum computers is increasing day by day. This article starts with the simple principle of quantum computing, introduces the most advanced quantum computing instruments and quantum computing algorithms, and points out the application prospects in medicine, chemistry and other fields. This paper explains the basic principles of quantum computing algorithms, their efficiency over traditional algorithms, and focuses on the Shor algorithm and its’ variations. In terms of applications, the quantum computer Zu Chongzhi and its contribution to the sampling problem of quantum random circuits are introduced. This paper makes a certain analysis of the limitations of quantum computing, and gives the future development goals in a targeted manner. Besides, we summarize popular quantum computing algorithms and applications, and make contributions to the promotion and development of quantum computing. Overall, these results shed light on guiding further exploration of how to improve the computational efficiency of quantum computers.
Traditional cryptography is suffering a huge threat from the development of quantum computing. While many currently used public-key cryptosystems would be broken by Shor's algorithm, the effect of quantum computing on symmetric ones is still unclear. The security of symmetric ciphers relies heavily on the development of cryptanalytic tools. Thus, in order to accurately evaluate the security of symmetric primitives in the post-quantum world, it is significant to improve classical cryptanalytic methods using quantum algorithms. In this paper, we focus on two variants of differential cryptanalysis: truncated differential cryptanalysis and impossible differential cryptanalysis. Based on the fact that Bernstein-Vazirani algorithm can be used to find the linear structures of Boolean functions, we propose two quantum algorithms that can be used to find high-probability truncated differentials and impossible differentials of block ciphers, respectively. We rigorously prove the validity of the algorithms and analyze their complexity. Our algorithms treat all rounds of the reduced cipher as a whole and only concerns the input and output differences at its both ends, instead of specific differential characteristics. Therefore, to a certain extent, they alleviate the weakness of conventional differential cryptanalysis, namely the difficulties in finding differential characteristics as the number of rounds increases.