Quantum Hash Function Scheme via Continuous Time Quantum Walks Employing Alternate Hamiltonian in Evolution Operator

In this article, we design a quantum hash function generation scheme via continuous time quantum walks on path graph. The quantum hash function generated in this work is showing strong cryptographic properties in performance tests like collision, sensitivity, uniformity and statistical analysis. We employ evolution operators of continuous time quantum walks consisting of the adjacency matrix and Laplacian matrix of the path as Hamiltonian. The bits in the binary input message select the Hamiltonian in evolution operator. This procedure makes the hash function robust and strong. Our work offers a structured framework utilizing quantum mechanics phenomena to construct strong cryptographic primitives exhibiting remarkable performance, building roads for promising secure communications.