Quantum Hashing Via Classical epsilon-universal Hashing Constructions

Ablayev Farid, Ablayev Marat. Arxiv 2014

[Paper]    
ARXIV Independent

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.

Similar Work

• A Quantum Algorithm To Locate Unknown Hashgrams
• Quantum Security Of Hash Functions And Property-preservation Of Iterated Hashing
• The Lower Energy Consumption In Cryptocurrency Mining Processes By SHA-256 Quantum Circuit Design Used In Hybrid Computing Domains
• On Finding Quantum Multi-collisions