Proposed technique demonstrates collision and preimage resistance in binary quantum hashing, implying enhanced cryptographic security.
We propose a binary quantum hashing technique that allows to present binary inputs by quantum states. We prove the cryptographic properties of the quantum hashing, including its collision resistance and preimage resistance. We also give an efficient quantum algorithm that performs quantum hashing, and altogether this means that this function is quantum one-way. The proposed construction is asymptotically optimal in the number of qubits used.
No takes yet. Share an insight, caveat, or question.
Alexander Vasiliev (2016) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: