This article is cited in 3 papers

Brief communications

Binary quantum hashing

A. V. Vasiliev

Kazan (Volga Region) Federal University, 18 Kremlyovskaya str., Kazan, 420008 Russia

Abstract: 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.

Keywords: quantum computation, quantum cryptography, quantum hashing, binary linear codes, quantum branching programs.

UDC: 519.7

Presented by the member of Editorial Board: N. K. Zamov
Received: 22.12.2015

 English version: Russian Mathematics (Izvestiya VUZ. Matematika), 2016, 60:9, 61–65

Bibliographic databases:

• 
•