We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Simple hash function using discrete-time quantum walks.
- Authors
Yang, Yu-Guang; Bi, Jing-Lin; Chen, Xiu-Bo; Yuan, Zheng; Zhou, Yi-Hua; Shi, Wei-Min
- Abstract
Hash functions play an essential role in many cryptographic applications such as digital signature, integrity authentication, and key derivation. Most of them are iteratively built based on the Merkle-Damgård (MD) structure. Unfortunately the traditional MD structure is suffering from various attacks, and thus the design of new hash functions is emerging. In this paper, inspired by quantum computation, we present a new hash function by introducing alternate single-qubit coin operators into discrete-time quantum walk. The present hash function is classical with classical input and output. The compressive function can be implemented by performing alternate single-qubit coin operators on the coin state controlled by a classical input binary message and then applying the global conditional shift operator on the position state and the coin state. The classical output hash value is generated by making amplification, truncation, and modular operation on the final probability distribution. Numerical simulation and performance comparison show that the present hash function has an excellent property of collision resistance and easier implementation than existing quantum-walk-based hash functions. It promotes more applications of quantum computation in the design of hash functions.
- Subjects
CRYPTOGRAPHY; DIGITAL signatures; IMPACT (Mechanics); COMPLEXITY (Philosophy); LOGARITHMS
- Publication
Quantum Information Processing, 2018, Vol 17, Issue 8, p1
- ISSN
1570-0755
- Publication type
Article
- DOI
10.1007/s11128-018-1954-2