Fully Quantum Hash Function
Shreya Banerjee, Harshita Meena, Somanath Tripathy, Prasanta K., Panigrahi

TL;DR
This paper introduces a fully quantum hash function leveraging quantum walk on a cycle and single-qubit computation, achieving high security, zero collisions, and efficiency with minimal resources, advancing quantum cryptography.
Contribution
It presents a novel fully quantum hash function using quantum walks and single-qubit computation, enhancing security and efficiency over classical and existing quantum protocols.
Findings
Zero collision rate achieved
Over 50% avalanche effect on average
Requires minimal quantum resources
Abstract
We introduce a novel, \textit{fully} quantum hash (FQH) function within the quantum walk on a cycle framework. We incorporate deterministic quantum computation with a single qubit to replace classical post-processing, thus increasing the inherent security. Further, our proposed hash function exhibits zero collision rate and high reliability. We further show that it provides avalanche on average, and is highly sensitive to the initial conditions. We show comparisons of several performance metrics for the proposed FQH with different settings as well as with existing protocols to prove its efficacy. FQH requires minimal quantum resources to produce a large hash value, providing security against the birthday attack. This innovative approach thus serves as an efficient hash function and lays the foundation for potential advancements in quantum cryptography by integrating the fully…
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
