From Graphs to Keyed Quantum Hash Functions
Mansur Ziatdinov
TL;DR
This paper introduces two novel quantum hash functions utilizing expander graphs and extractor functions, and proposes a keyed quantum hash function for message authentication, analyzing their security and randomness requirements.
Contribution
It presents new constructions of quantum hash functions based on graph theory and extractors, and introduces a keyed quantum hash function for authentication with security assessment.
Findings
Quantum hash functions based on expander graphs and extractors are feasible.
The keyed quantum hash function can be used for quantum message authentication.
Estimated randomness needed for constructing these quantum hash functions.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cryptographic Implementations and Security · Intelligence, Security, War Strategy