A hash collision is any pair of values (preimages) that when hashed produce the same digest (image). Finding even one example of a collision should be infeasible in a cryptographically secure hash function.
4
votes
0answers
86 views
Pseudo preimage for a hash made from a cipher
Consider the Miyaguchi–Preneel construction:
$H_0 = E(0,m_0) \oplus m_0$ (0 here means a vector filled with zeros)
$H_1 = E(H_0,m_1) \oplus H_0 \oplus m_1$
where $E(K,M)$ is a block cipher (for ...
