We present a version of quantum hash functions 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 properties analogous to classical cryptographic hash second pre-image resistance and collision resistance.
No takes yet. Share an insight, caveat, or question.
Ablayev et al. (2013) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: