Quantum algorithm to find invariant linear structure of MD hash functions

DOI10.1007/S11128-014-0909-5MaRDI QIDQ2018202zbMATH OpenOpenAlexFDO

Authors Huanguo Zhang, Shaowu Mao, Houzhen Wang, 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

zbMATH Keywords

\(MD\) hash functionsinvariant linear structurequantum algorithmquantum network

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)

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

Cites work

• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• How to Break MD5 and Other Hash Functions
• scientific article; zbMATH DE number 5899233 (Why is no real title available?)
• scientific article; zbMATH DE number 5320241 (Why is no real title available?)
• scientific article; zbMATH DE number 503258 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• On the Power of Quantum Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum lower bound for the collision problem
• Quantum lower bound for the collision problem with small range

Cited in

(8)

• Quantum algorithm to solve function inversion with time-space trade-off
• Quantum protocols for secure multi-party summation
• Polynomial-time quantum algorithms for finding the linear structures of Boolean function
• Quantum search for scaled hash function preimages
• Rapid solution of problems by quantum computation
• General quantum meet-in-the-middle search algorithm based on target solution of fixed weight
• A public key cryptosystem based on data complexity under quantum environment
• Two-party quantum private comparison protocol with maximally entangled seven-qubit state

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)