|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, Number 9, Pages 68–73
(Mi ivm9153)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
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.
Citation:
A. V. Vasiliev, “Binary quantum hashing”, Izv. Vyssh. Uchebn. Zaved. Mat., 2016, no. 9, 68–73; Russian Math. (Iz. VUZ), 60:9 (2016), 61–65
Linking options:
https://www.mathnet.ru/eng/ivm9153 https://www.mathnet.ru/eng/ivm/y2016/i9/p68
|
Statistics & downloads: |
Abstract page: | 305 | Full-text PDF : | 94 | References: | 43 | First page: | 6 |
|