KFU. Card publication. Quantum Hashing via Classical ε-universal Hashing Constructions

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

QUANTUM HASHING VIA CLASSICAL ε-UNIVERSAL HASHING CONSTRUCTIONS

Form of presentation

Articles in international journals and collections

Year of publication

2014

Authors, employees of KFU

Ablaev Marat Faridovich, author

Ablaev Farid Mansurovich, author

Bibliographic description in the original language

Farid Ablayev, Marat Ablayev. Quantum Hashing via Classical ε-universal Hashing Constructions, Cornell University library, arXiv:1404.1503 [quant-ph] 2014

Annotation

n 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. The proposed construction combines the properties of robust presentation of information by classical error-correcting codes together with the possibility of highly compressed presentation of information by quantum systems. In particularly, we present quantum hash function based on Reed-Solomon code, and we proved, that this construction is optimal in the sense of number of qubits needed.

Keywords

quantum computations, quantum cryptography, hashing

URL

http://arxiv.org/abs/1404.1503

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=80547&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ablaev Marat Faridovich	ru_RU
dc.contributor.author	Ablaev Farid Mansurovich	ru_RU
dc.date.accessioned	2014-01-01T00:00:00Z	ru_RU
dc.date.available	2014-01-01T00:00:00Z	ru_RU
dc.date.issued	2014	ru_RU
dc.identifier.citation	Farid Ablayev, Marat Ablayev. Quantum Hashing via Classical ε-universal Hashing Constructions, Cornell University library, arXiv:1404.1503 [quant-ph] 2014	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=80547&p_lang=2	ru_RU
dc.description.abstract	n 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. The proposed construction combines the properties of robust presentation of information by classical error-correcting codes together with the possibility of highly compressed presentation of information by quantum systems. In particularly, we present quantum hash function based on Reed-Solomon code, and we proved, that this construction is optimal in the sense of number of qubits needed.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	quantum computations	ru_RU
dc.subject	quantum cryptography	ru_RU
dc.subject	hashing	ru_RU
dc.title	Quantum Hashing via Classical ε-universal Hashing Constructions	ru_RU
dc.type	Articles in international journals and collections	ru_RU