From graphs to keyed quantum hash functions
- Autores: Ziatdinov M.1
-
Afiliações:
- Quantum Informatics Laboratory, Institute of Computational Mathematics and Information Technologies
- Edição: Volume 37, Nº 6 (2016)
- Páginas: 705-712
- Seção: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198385
- DOI: https://doi.org/10.1134/S1995080216060202
- ID: 198385
Citar
Resumo
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.
Sobre autores
M. Ziatdinov
Quantum Informatics Laboratory, Institute of Computational Mathematics and Information Technologies
Autor responsável pela correspondência
Email: gltronred@gmail.com
Rússia, Kremlevskaya ul. 35, Kazan, Tatarstan, 420008
![](/img/style/loading.gif)