Cryptanalysis Of Block Ciphers And Hash Function Based On Grover’s Quantum Search Algorithms

Grover’s quantum search algorithm has studied widely for its general applicability. Relied on quantum parallel computing, the time complexity of Grover algorithm is only O ( N ) on quantum computer compared to O(N) on classical computer At present, Grover algorithm is more focused on the algorithm’s improvement while little on the analysis of cryptographic. Meanwhile, the optimization of computational complexity is not ideal using classic cryptanalysis.The study on cryptanalysis based on quantum search algorithm not only extends the scope of application on quantum algorithms and applications, but also helps to understand issues on quantum search algorithm applications, which have practical significance on the information security of national security and commercial interests.This paper presents the cryptanalysis models on block cipher algorithm and hash functions using quantum search algorithm. The models can be integrated into quantum block-box Oracle which is the most important part of Grover’s iteration. And the time complexity of solving the problem of block cipher’s key search and hash collision is only O ( N ).More specificly, we pose the circuit design of the basic logic operations, and its simulation results proving the correctness of the design. In the analysis of block ciphers, we combined classic parallel computing to get further acceleration. In the analysis of hash functions, according to the diffusion of the hash algorithms, the time complexity of the collision search is focused on the length of a single register. Meanwhile, this paper puts forward the quantum circuit design of DES, MD5 and SHA-256 algorithm which can be used in the following simulation and also can be used as the basis of the quantum chip design.