Kazan (Volga region) Federal University, KFU
KAZAN
FEDERAL UNIVERSITY
 
QUANTUM HASHING VIA CLASSICAL ε-UNIVERSAL HASHING CONSTRUCTIONS
Form of presentationArticles in international journals and collections
Year of publication2014
  • 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