Hi,
For wikipedia I read:
Joux[3] noted that 2-collisions lead to n-collisions: if it is feasible to find two messages with the same MD5 hash, it is effectively no more difficult to find as many messages as the attacker desires with identical MD5 hashes.
But why is this so? I can't imagine why? The algorithms are open right, people can read the maths which generates the hashes, which is the digest machinery. So if we know one collision why does it help find new ones?
Is it just making small iterations to both of the first collision messages and then monitoring their changes to remap them?
Best,