Constructing quantum hash functions based on quantum walks on Johnson graphs
From MaRDI portal
Publication:1993776
DOI10.1007/s11128-018-1923-9zbMath1433.81063OpenAlexW2804907977MaRDI QIDQ1993776
Wei-Min Shi, Dan Li, Yu-Guang Yang, Yi-Hua Zhou, Yong-Ce Zhang, Wei-Feng Cao
Publication date: 5 November 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-018-1923-9
Cryptography (94A60) Quantum control (81Q93) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (5)
Controlled alternate quantum walk-based block hash function ⋮ Lackadaisical discrete-time quantum walk on Johnson graph ⋮ Discrete-time quantum walk search on Johnson graphs ⋮ Usefulness of decoherence in quantum-walk-based hash function ⋮ Hash function based on quantum walks
Cites Work
- Unnamed Item
- Unnamed Item
- Discrete-time interacting quantum walks and quantum hash schemes
- Analysis of the two-particle controlled interacting quantum walks
- Cryptanalysis of MD4
- From graphs to keyed quantum hash functions
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- Computing Boolean Functions via Quantum Hashing
- Finding Preimages in Full MD5 Faster Than Exhaustive Search
- Directional correlations in quantum walks with two particles
- Quantum walks on graphs
- Advances in Cryptology - EUROCRYPT 2004
- Graph isomorphism in quasipolynomial time [extended abstract]
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
- A Meet-in-the-Middle Collision Attack Against the New FORK-256
This page was built for publication: Constructing quantum hash functions based on quantum walks on Johnson graphs