Return to Answer

The answer is due to the Stevens et. al's work.

They showed that, with an approximately $2^{39}$ calls to the MD5 compression function, it is possible, for any chosen $m_1$ and $m_2$, to construct $s_1$ and $s_2$ such that $\text{MD5} (m_1||s_1) = \text{MD5} (m_2||s_2)$.

They also gave examples for colliding documents, software integrity checking, etc ...

The answer is due to the Stevens et. al's work ;

• Chosen-prefix collisions for MD5 and applications, 2012.

They showed that, with an approximately $2^{39}$ calls to the MD5 compression function, it is possible, for any chosen $m_1$ and $m_2$, to construct $s_1$ and $s_2$ such that $$\text{MD5} (m_1\mathbin\|s_1) = \text{MD5} (m_2\mathbin\|s_2)$$

They also gave examples for colliding documents, software integrity checking, etc ...

The answer is due to the Stevens et. al's work.

They showed that with an approximate expected calling of MDF compression function, that is $2^{39}$-times, for any chosen $m_1$ and $m_2$ such $s_1$ and $s_2$ can be constructed to have $\text{MD5} (m_1||s_1) = \text{MD5} (m_1||s_1)$.

They also gave examples for colliding documents, software integrity checking etc.

The answer is due to the Stevens et. al's work.

They showed that, with an approximately $2^{39}$ calls to the MD5 compression function, it is possible, for any chosen $m_1$ and $m_2$, to construct $s_1$ and $s_2$ such that $\text{MD5} (m_1||s_1) = \text{MD5} (m_2||s_2)$.

They also gave examples for colliding documents, software integrity checking, etc ...

The answer is due to the Stevens et. al work.

They showed that with an approximate expected calling of MDF compression function, that is $2^{39}$-times, for any chosen $m_1$ and $m_2$ such $s_1$ and $s_2$ can be constructed to have $\text{MD5} (m_1||s_1) = \text{MD5} (m_1||s_1)$.

They also gave examples for Colliding documents, Software integrity checking etc.

The answer is due to the Stevens et. al's work.

They showed that with an approximate expected calling of MDF compression function, that is $2^{39}$-times, for any chosen $m_1$ and $m_2$ such $s_1$ and $s_2$ can be constructed to have $\text{MD5} (m_1||s_1) = \text{MD5} (m_1||s_1)$.

They also gave examples for colliding documents, software integrity checking etc.