Quantum hashing for finite abelian groups

dc.contributor.author	Vasiliev A.
dc.date.accessioned	2018-09-19T22:10:36Z
dc.date.available	2018-09-19T22:10:36Z
dc.date.issued	2016
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/144814
dc.description.abstract	© 2016, Pleiades Publishing, Ltd.We propose a generalization of the quantum hashing technique based on the notion of small-bias sets. These sets have proved useful in different areas of computer science, and here their properties give an optimal construction for succinct quantum presentation of elements of any finite abelian group, which can be used in various computational and cryptographic scenarios. We consider two special cases of the proposed quantum hashing which turn out to be the known quantum fingerprinting schemas.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	finite groups
dc.subject	Quantum cryptography
dc.subject	quantum hashing
dc.subject	small-bias sets
dc.title	Quantum hashing for finite abelian groups
dc.type	Article
dc.relation.ispartofseries-issue	6
dc.relation.ispartofseries-volume	37
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	753
dc.source.id	SCOPUS19950802-2016-37-6-SID84994494528

Файлы в этом документе

Размер: 43.70Kb

Формат: PDF

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