|
Itogi Nauki i Tekhniki. Sovremennaya Matematika i ee Prilozheniya. Tematicheskie Obzory, 2017, Volume 138, Pages 11–18
(Mi into211)
|
|
|
|
Analysis of properties of quantum hashing
A. V. Vasiliev, A. R. Vasilov, M. A. Latypov Kazan (Volga Region) Federal University
Abstract:
We analyze a method of binary quantum hashing that allows one to
represent binary sets as quantum states. We show that this method
is very stable with respect to the recovery of preimages.
Moreover, we propose heuristic approaches to small-bias sets on
which the construction of quantum hash-functions is based and show
that they are stable with respect to collisions.
Keywords:
quantum computing, quantum cryptography, quantum hashing, linear binary code, random search, particle swarm algorithm.
Citation:
A. V. Vasiliev, A. R. Vasilov, M. A. Latypov, “Analysis of properties of quantum hashing”, Quantum computing, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 138, VINITI, Moscow, 2017, 11–18; Journal of Mathematical Sciences, 241:2 (2019), 117–124
Linking options:
https://www.mathnet.ru/eng/into211 https://www.mathnet.ru/eng/into/v138/p11
|
Statistics & downloads: |
Abstract page: | 469 | Full-text PDF : | 121 | First page: | 6 |
|