Binary quantum hashing

dc.contributor.author	Vasiliev A.
dc.date.accessioned	2018-09-19T20:55:07Z
dc.date.available	2018-09-19T20:55:07Z
dc.date.issued	2016
dc.identifier.issn	1066-369X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/143425
dc.description.abstract	© 2016, Allerton Press, Inc.We propose a binary quantum hashing technique that allows to present binary inputs by quantum states. We prove the cryptographic properties of the quantum hashing, including its collision resistance and preimage resistance. We also give an efficient quantum algorithm that performs quantum hashing, and altogether this means that this function is quantum one-way. The proposed construction is asymptotically optimal in the number of qubits used.
dc.relation.ispartofseries	Russian Mathematics
dc.subject	binary linear codes
dc.subject	quantum branching programs
dc.subject	quantum computation
dc.subject	quantum cryptography
dc.subject	quantum hashing
dc.title	Binary quantum hashing
dc.type	Article
dc.relation.ispartofseries-issue	9
dc.relation.ispartofseries-volume	60
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	61
dc.source.id	SCOPUS1066369X-2016-60-9-SID84979256578

Files in this item

Size: 43.63Kb

Format: PDF

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