Email this article From graphs to keyed quantum hash functions
- Authors: Ziatdinov M.1
-
Affiliations:
- Quantum Informatics Laboratory, Institute of Computational Mathematics and Information Technologies
- Issue: Vol 37, No 6 (2016)
- Pages: 705-712
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198385
- DOI: https://doi.org/10.1134/S1995080216060202
- ID: 198385
Cite item
Open Access
Access granted
Subscription Access
Abstract
We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them. We also propose a keyed quantum hash function based on extractor function that can be used in quantum message authentication codes and assess its security in a limited attacker model.
About the authors
M. Ziatdinov
Quantum Informatics Laboratory, Institute of Computational Mathematics and Information Technologies
Author for correspondence.
Email: gltronred@gmail.com
Russian Federation, Kremlevskaya ul. 35, Kazan, Tatarstan, 420008
