[Resource Topic] 2001/020: Some observations on the theory of cryptographic hash functions

Welcome to the resource topic for 2001/020

Some observations on the theory of cryptographic hash functions

Authors: D. R. Stinson


In this paper, we study several issues related to the notion of
secure'' hash functions. Several necessary conditions are considered, as well as a popular sufficient condition (the so-called random oracle model). We study the security of various problems that are motivated by the notion of a secure hash function. These problems are analyzed in the random oracle model, and we prove that the obvious trivial algorithms are optimal. As well, we look closely at reductions between various problems. In particular, we consider the important question does preimage resistance imply
collision resistance?‘’. Finally, we study the relationship
of the security of
hash functions built using the Merkle-Damgard construction
to the security of the underlying compression function.

ePrint: https://eprint.iacr.org/2001/020

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .