Lower Bound on Number of Compression Calls of a Collision-Resistance Preserving Hash

ePrint Report: Lower Bound on Number of Compression Calls of a Collision-Resistance Preserving Hash

Debasmita Chakraborty, Mridul Nandi

The collision-resistant hash function is an early cryptographic primitive
that finds extensive use in various applications. Remarkably, the Merkle-Damgård
and Merkle tree hash structures possess the collision-resistance preserving property,
meaning the hash function remains collision-resistant when the underlying compression function is collision-resistant. This raises the intriguing question of whether reducing the number of underlying compression function calls with the collision-resistance …

applications collision collision-resistance compression cryptographic eprint report function hash hash function merkle property report