Demonstration and Implementation of Quantum Computing in Cryptanalysis

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.