Continuous-time quantum hash function based on one-dimensional cycle lattice

Abstract

The proposed quantum hash function (QHF) based on the discrete-time quantum walk (DTQW) structure requires enlarging the coin state space and the preparation of continuous quantum states is less difficult. Hence, a new construction method of QHF is proposed based on the continuous-time quantum walk (CTQW) of the one-dimensional (1D) lattice with boundary constraints and without additional coin space. In the scheme, the input of the QHF is an arbitrary binary string message which is used to control the selected Hamiltonian of CTQW at each time interval, and the output of the QHF is the final probability distribution of CTQW. Under the same computing environment, simulation and analysis indicate that our QHF can satisfy the same security requirements such as sensitivity, diffusion and confusion, collision, birthday attack, but the collision rate is reduced by 40% without reducing effectiveness.