From graphs to keyed quantum hash functions

dc.contributor.author	Ziatdinov M.
dc.date.accessioned	2018-09-19T22:10:41Z
dc.date.available	2018-09-19T22:10:41Z
dc.date.issued	2016
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/144817
dc.description.abstract	© 2016, Pleiades Publishing, Ltd.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.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	expander graph
dc.subject	extractor
dc.subject	keyed quantum hash function
dc.subject	message authentication
dc.subject	Quantum hash function
dc.title	From graphs to keyed quantum hash functions
dc.type	Article
dc.relation.ispartofseries-issue	6
dc.relation.ispartofseries-volume	37
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	705
dc.source.id	SCOPUS19950802-2016-37-6-SID84994499952

Files in this item

Size: 43.58Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.