Constructing quantum hash functions based on quantum walks on Johnson graphs
From MaRDI portal
Recommendations
Cites work
- A Meet-in-the-Middle Collision Attack Against the New FORK-256
- A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
- Advances in Cryptology - EUROCRYPT 2004
- Analysis of the two-particle controlled interacting quantum walks
- Computing Boolean functions via quantum hashing
- Cryptanalysis of MD4
- Directional correlations in quantum walks with two particles
- Discrete-time interacting quantum walks and quantum hash schemes
- Finding Preimages in Full MD5 Faster Than Exhaustive Search
- From graphs to keyed quantum hash functions
- Graph isomorphism in quasipolynomial time (extended abstract)
- scientific article; zbMATH DE number 1302838 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- Quantum Algorithms for the Triangle Problem
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks on graphs
Cited in
(11)- Simple hash function using discrete-time quantum walks
- Usefulness of decoherence in quantum-walk-based hash function
- Hash function based on quantum walks
- From graphs to keyed quantum hash functions
- Discrete-time interacting quantum walks and quantum hash schemes
- Controlled alternate quantum walk-based block hash function
- Lackadaisical discrete-time quantum walk on Johnson graph
- Discrete-time quantum walk search on Johnson graphs
- Multi-target quantum walk search on Johnson graph
- Quantum hash function scheme via continuous time quantum walks employing alternate Hamiltonian in evolution operator
- Efficient quantum detectable weak Byzantine agreement with optimal fault-tolerant bound
This page was built for publication: Constructing quantum hash functions based on quantum walks on Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993776)