Analysis of Properties of Quantum Hashing

dc.contributor.author	Vasiliev A.
dc.contributor.author	Vasilov A.
dc.contributor.author	Latypov M.
dc.date.accessioned	2020-01-15T21:46:06Z
dc.date.available	2020-01-15T21:46:06Z
dc.date.issued	2019
dc.identifier.issn	1072-3374
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/155765
dc.description.abstract	© 2019, Springer Science+Business Media, LLC, part of Springer Nature. We analyze a method of binary quantum hashing that allows one to represent binary sets as quantum states. We show that this method is very stable with respect to the recovery of preimages. Moreover, we propose heuristic approaches to small-bias sets on which the construction of quantum hash-functions is based and show that they are stable with respect to collisions.
dc.relation.ispartofseries	Journal of Mathematical Sciences (United States)
dc.subject	81P94
dc.subject	linear binary code
dc.subject	particle swarm algorithm
dc.subject	quantum computing
dc.subject	quantum cryptography
dc.subject	quantum hashing
dc.subject	random search
dc.title	Analysis of Properties of Quantum Hashing
dc.type	Article
dc.relation.ispartofseries-issue	2
dc.relation.ispartofseries-volume	241
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	117
dc.source.id	SCOPUS10723374-2019-241-2-SID85069921974

Files in this item

Size: 91.11Kb

Format: PDF

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