Мақаланы 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
