Form of presentation | Articles in international journals and collections |
Year of publication | 2015 |
Язык | английский |
|
Ablaev Farid Mansurovich, author
Ablaev Farid Mansurovich, author
|
Bibliographic description in the original language |
F. Ablayev, M. Ablayev. Quantum hashing via ∈ -universal hashing constructions and classical fingerprinting // Lobachevskii Journal of Mathematics
April 2015, Volume 36, Issue 2, pp 89-96 |
Annotation |
Lobachevskii Journal of Mathematics April 2015, Volume 36, Issue 2, pp 89-96 |
Keywords |
cryptography, hashing, quantum algorithms, |
The name of the journal |
Lobachevskii J. of Mathematics
|
URL |
http://link.springer.com/article/10.1134/S199508021502002X |
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=110207&p_lang=2 |
Full metadata record ![](https://shelly.kpfu.ru/pdf/picture/arrow_black_right.gif) |
Field DC |
Value |
Language |
dc.contributor.author |
Ablaev Farid Mansurovich |
ru_RU |
dc.contributor.author |
Ablaev Farid Mansurovich |
ru_RU |
dc.date.accessioned |
2015-01-01T00:00:00Z |
ru_RU |
dc.date.available |
2015-01-01T00:00:00Z |
ru_RU |
dc.date.issued |
2015 |
ru_RU |
dc.identifier.citation |
F. Ablayev, M. Ablayev. Quantum hashing via ∈ -universal hashing constructions and classical fingerprinting // Lobachevskii Journal of Mathematics
April 2015, Volume 36, Issue 2, pp 89-96 |
ru_RU |
dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=110207&p_lang=2 |
ru_RU |
dc.description.abstract |
Lobachevskii J. of Mathematics |
ru_RU |
dc.description.abstract |
Lobachevskii Journal of Mathematics April 2015, Volume 36, Issue 2, pp 89-96 |
ru_RU |
dc.description.abstract |
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 $\epsilon$-universal hash family and a given family of functions -- quantum hash generator.
In particular, using the relationship between $\epsilon$-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.} |
ru_RU |
dc.language.iso |
ru |
ru_RU |
dc.subject |
cryptography |
ru_RU |
dc.subject |
hashing |
ru_RU |
dc.subject |
quantum algorithms |
ru_RU |
dc.subject |
|
ru_RU |
dc.title |
Quantum hashing via ∈ -universal hashing constructions and classical fingerprinting |
ru_RU |
dc.type |
Articles in international journals and collections |
ru_RU |
|