КФУ. Карточка публикации. Quantum Hashing via Classical ε-universal Hashing Constructions

КАЗАНСКИЙ
ФЕДЕРАЛЬНЫЙ УНИВЕРСИТЕТ

RUS

- EN
- 中文
- ES

QUANTUM HASHING VIA CLASSICAL ε-UNIVERSAL HASHING CONSTRUCTIONS

Форма представления

Статьи в зарубежных журналах и сборниках

Год публикации

2014

Авторы, сотрудники КФУ

Аблаев Марат Фаридович, автор

Аблаев Фарид Мансурович, автор

Библиографическое описание на языке оригинала

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

Аннотация

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.

Ключевые слова

quantum computations, quantum cryptography, hashing

URL

http://arxiv.org/abs/1404.1503

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на эту карточку

https://repository.kpfu.ru/?p_id=80547

Полная запись метаданных

Поле DC	Значение	Язык
dc.contributor.author	Аблаев Марат Фаридович	ru_RU
dc.contributor.author	Аблаев Фарид Мансурович	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/?p_id=80547	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	Статьи в зарубежных журналах и сборниках	ru_RU