Paper 2004/324

On a Probabilistic Approach to the Security Analysis of Cryptographic Hash Functions

G. Laccetti and G. Schmid

Abstract

In this paper we focus on the three basic security requirements for a cryptographic hash function, commonly referred as preimage, second preimage and collision resistance. We examine these security requirements in the case of attacks which do not take advantage on how the hash function is computed, expressing them as success probabilities of suitable randomized algorithms. We give exact mathematical expressions for such resistance indices, and obtain their functional behaviour in relation to the amount of uniformity in the hash function outcomes. Our work provides a mathematical framework for the study of cryptographic hash functions, which enable us to give proofs for some prevailing beliefs.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
Hash functionsBrute force attacksResistance
Contact author(s)
schmid @ unina it
History
2004-11-26: received
Short URL
https://ia.cr/2004/324
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/324,
      author = {G.  Laccetti and G.  Schmid},
      title = {On a Probabilistic Approach to the Security Analysis of Cryptographic Hash Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2004/324},
      year = {2004},
      note = {\url{https://eprint.iacr.org/2004/324}},
      url = {https://eprint.iacr.org/2004/324}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.