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:

• A Standard for the Transmission of IP Datagrams on Avian Carriers
• Cryptographic Primitive
• Hash Function Security Properties
• Homomorphic Encryption
• MD4
• Merkle-Damgard construction
• NT LAN Manager
• NTLM
• NTLM SSP
• NTLMv1
• NTLMv2
• SHA256