Hash Security Research Based On Quantum Computing

Hash function plays a very important role in many cryptographic security protocols.As the cornerstone of digital signatures,it is not only used to detect whether network communication information has been tampered with,but also a key technology to ensure the security of multiple cryptographic systems such as digital fingerprints and identity authentication.At present,the analysis of Hash functions is based on the analysis of number theory problems.They are all based on classical calculations.Hash functions are imported.It is impossible to evaluate their ability to resist quantum computer attacks and explore the security of quantum computing in Hash functions.Research is important.With the development of quantum information technology,based on quantum characteristics,quantum information technology can break through the physical limit of the extreme speed of existing information,and will play a great role in information processing speed,information security,and computing power.Quantum information technology will open up new principles and methods for the development of information science,which will have a profound impact on human society.Research on cryptographic analysis based on quantum computing not only expands the scope and value of quantum computing and quantum algorithms,but also provides research value for modern cryptographic protocols in postquantum cryptography anyway,which is related to future information security and quantum computer Development has very important meaning and value.The thesis focuses on the antigenicity and anti-collision of the Hash function of quantum algorithms.This article first analyzes the composition principle of quantum circuits,and designs corresponding quantum gate circuits according to the logic operations required by the hash function,and gives the corresponding circuit diagrams and simulation verification.In analyzing the preimage resistance of the hash function,the existing Grover quantum algorithm is improved,and the size of the entire quantum circuit is reduced by the idea of time and space tradeoffs,and the corresponding quantum hash image is attacked on the road map.Then,the Oracle circuit is designed by quantum memory to analyze the Hash collision problem of Grover algorithm application,and the performance analysis and corresponding simulation experiments of the improved algorithm are given.At the same time,the Deutsch-Jozsa algorithm is improved for the collision problem of Hash functions,a corresponding set-specific collision problem is designed.The hash collision between two collection spaces can be determined through only one quantum measurement,and a performance analysis is given.