Graph explorer

Quantum Hashing

We present a version of quantum hash function based on non-binary discrete functions. The proposed quantum procedure is "classical-quantum", that is, it takes a classical bit string as an input and produces a quantum state. The resulting function has the property of a one-way function (pre-image resistance), in addition it has the properties analogous to classical cryptographic hash second pre-image resistance and collision resistance. This function can be naturally used in a quantum digital signature protocol.