2014/04/05 by Farid Ablayev, Ablayev, Farid, Marat Ablayev +1
Computer Science · #Algorithms and Data Compression #Coding theory and cryptography #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1404.1503
openalex publication_date 2014/04/05 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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. 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.