From Graphs to Keyed Quantum Hash Functions

2016/05/31 by Ziatdinov, Mansur
#FOS: Physical sciences #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.1606.00256

Abstract

We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them. We also propose a keyed quantum hash function based on extractor function that can be used in quantum message authentication codes and assess its security in a limited attacker model.

Related

• Designing Hash and Encryption Engines using Quantum Computing
• Quantum Hashing via Classical ε-universal Hashing Constructions
• Quantum security of hash functions and property-preservation of iterated hashing
• Improving Classical Authentication with Quantum Communication
• Fully Quantum Hash Function