Отправить статью по E-mail From graphs to keyed quantum hash functions
- Авторы: Ziatdinov M.1
-
Учреждения:
- Quantum Informatics Laboratory, Institute of Computational Mathematics and Information Technologies
- Выпуск: Том 37, № 6 (2016)
- Страницы: 705-712
- Раздел: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198385
- DOI: https://doi.org/10.1134/S1995080216060202
- ID: 198385
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
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.
Об авторах
M. Ziatdinov
Quantum Informatics Laboratory, Institute of Computational Mathematics and Information Technologies
Автор, ответственный за переписку.
Email: gltronred@gmail.com
Россия, Kremlevskaya ul. 35, Kazan, Tatarstan, 420008
