Binary quantum hashing
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (2016), pp. 68-73

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{IVM_2016_9_a6,
     author = {A. V. Vasiliev},
     title = {Binary quantum hashing},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {68--73},
     publisher = {mathdoc},
     number = {9},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2016_9_a6/}
}
TY  - JOUR
AU  - A. V. Vasiliev
TI  - Binary quantum hashing
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2016
SP  - 68
EP  - 73
IS  - 9
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2016_9_a6/
LA  - ru
ID  - IVM_2016_9_a6
ER  - 
%0 Journal Article
%A A. V. Vasiliev
%T Binary quantum hashing
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2016
%P 68-73
%N 9
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2016_9_a6/
%G ru
%F IVM_2016_9_a6
A. V. Vasiliev. Binary quantum hashing. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (2016), pp. 68-73. http://geodesic.mathdoc.fr/item/IVM_2016_9_a6/