jspωiki
Collision Resistance

Overview#

Collision Resistance implies, using the Computational Hardness Assumption, that it is not realistic to find two messages which produce the same Hash or Message-Digest

Failure to be Collision Resistance results in a Cryptographic Collision and the Algorithm is then considered Cryptographically Weak

More Information#

There might be more information for this subject on one of the following: