Email this article Analysis of Properties of Quantum Hashing
- Authors: Vasiliev A.V.1, Vasilov A.R.1, Latypov M.A.1
-
Affiliations:
- Kazan Federal University
- Issue: Vol 241, No 2 (2019)
- Pages: 117-124
- Section: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/242867
- DOI: https://doi.org/10.1007/s10958-019-04412-9
- ID: 242867
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
A. V. Vasiliev
Kazan Federal University
Author for correspondence.
Email: alexander.ksu@gmail.com
Russian Federation, Kazan
A. R. Vasilov
Kazan Federal University
Email: alexander.ksu@gmail.com
Russian Federation, Kazan
M. A. Latypov
Kazan Federal University
Email: alexander.ksu@gmail.com
Russian Federation, Kazan
