Показать сокращенную информацию
dc.contributor.author | Ablayev F. | |
dc.contributor.author | Ablayev M. | |
dc.date.accessioned | 2018-09-18T20:34:48Z | |
dc.date.available | 2018-09-18T20:34:48Z | |
dc.date.issued | 2015 | |
dc.identifier.issn | 1995-0802 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/141342 | |
dc.description.abstract | © 2015, Pleiades Publishing, Ltd. In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of different quantum hash functions. The construction is based on composition of classical ∈-universal hash family and a given family of functions-quantum hash generator. In particular, using the relationship between ∈-universal hash families and Freivalds fingerprinting schemas we present explicit quantum hash function and prove that this construction is optimal in the sense of number of qubits needed for construction. | |
dc.relation.ispartofseries | Lobachevskii Journal of Mathematics | |
dc.subject | error-correcting codes | |
dc.subject | quantum hash function | |
dc.subject | quantum hashing | |
dc.subject | ∈-universal hashing | |
dc.title | Quantum hashing via ∈-universal hashing constructions and classical fingerprinting | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 2 | |
dc.relation.ispartofseries-volume | 36 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 89 | |
dc.source.id | SCOPUS19950802-2015-36-2-SID84934935846 |