Constructing quantum Hash functions based on quantum walks on Johnson graphs
| Autor: | Wei-Feng Cao, Wei-Min Shi, Yong-Ce Zhang, Yi-Hua Zhou, Dan Li, Yu-Guang Yang |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Discrete mathematics
Computer science Operator (physics) Hash function TheoryofComputation_GENERAL Statistical and Nonlinear Physics 0102 computer and information sciences Birthday attack Shift operator Collision 01 natural sciences Theoretical Computer Science Electronic Optical and Magnetic Materials Quantum cryptography 010201 computation theory & mathematics ComputerSystemsOrganization_MISCELLANEOUS Modeling and Simulation 0103 physical sciences Signal Processing Quantum walk Electrical and Electronic Engineering 010306 general physics Computer Science::Cryptography and Security Quantum computer |
| Zdroj: | Quantum Information Processing. 17 |
| ISSN: | 1573-1332 1570-0755 |
| DOI: | 10.1007/s11128-018-1923-9 |
| Popis: | We present a quantum hash function in a quantum walk framework on Johnson graphs. In this quantum hash function, the message bit decides which coin operator, i.e., Grover operator or DFT operator, is applied on the coin at each step. Then a fixed conditional shift operator is applied to decide the movement of the walker. Compared with existing quantum-walk-based hash functions, the present hash function has a lower collision rate and quantum resource cost. It provides a clue for the construction of other cryptography protocols by introducing the quantum walk model into hash functions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink