Quantum algorithm to find invariant linear structure of \(MD\) hash functions
From MaRDI portal
Publication:2018202
DOI10.1007/s11128-014-0909-5zbMath1311.81089OpenAlexW2068142153MaRDI QIDQ2018202
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
Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (5)
A public key cryptosystem based on data complexity under quantum environment ⋮ Quantum algorithm to solve function inversion with time-space trade-off ⋮ Rapid solution of problems by quantum computation ⋮ Two-party quantum private comparison protocol with maximally entangled seven-qubit state ⋮ Quantum protocols for secure multi-party summation
Cites Work
- Quantum lower bound for the collision problem
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- How to Break MD5 and Other Hash Functions
- Efficient Collision Search Attacks on SHA-0
- Finding Collisions in the Full SHA-1
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quantum algorithm to find invariant linear structure of \(MD\) hash functions