Quantum algorithm to find invariant linear structure of MD hash functions
DOI10.1007/S11128-014-0909-5zbMATH Open1311.81089OpenAlexW2068142153MaRDI QIDQ2018202FDOQ2018202
Huanguo Zhang, Houzhen Wang, Shaowu Mao, Wanqing Wu
Publication date: 13 April 2015
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-014-0909-5
Recommendations
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function
- Quantum multicollision-finding algorithm
- Quantum algorithm for the multicollision problem
- A quantum algorithm to approximate the linear structures of Boolean functions
- Quantum algorithms for the \(k\)-XOR problem
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Title not available (Why is that?)
- Quantum lower bound for the collision problem
- Finding Collisions in the Full SHA-1
- How to Break MD5 and Other Hash Functions
- Efficient Collision Search Attacks on SHA-0
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Quantum algorithm to solve function inversion with time-space trade-off
- Quantum search for scaled hash function preimages
- Two-party quantum private comparison protocol with maximally entangled seven-qubit state
- A public key cryptosystem based on data complexity under quantum environment
- Quantum protocols for secure multi-party summation
- Rapid solution of problems by quantum computation
This page was built for publication: Quantum algorithm to find invariant linear structure of \(MD\) hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018202)
