New techniques for the cryptanalysis of hash functions KU Leuven
Cryptographic hash functions map arbitrary length messages to fixed-length message digests. They are an essential building block in modern cryptography. For example, virtually all digital signature schemes produce a signature only on the message digest. To guarantee the security of this approach, it must be difficult to find two distinct messages with the same digest. Such a message pair is known as a collision and could be used to trick a ...