Journal of Cryptology

, Volume 8, Issue 2, pp 87–99

Necessary and sufficient conditions for collision-free hashing

Authors

  • Alexander Russell
    • Laboratory for Computer ScienceMassachusetts Institute of Technology
Article

DOI: 10.1007/BF00190757

Cite this article as:
Russell, A. J. Cryptology (1995) 8: 87. doi:10.1007/BF00190757

Abstract

This paper determines an exact relationship between collision-free hash functions and other cryptographic primitives. Namely, it introduces a new concept, the pseudopermutation, and shows that the existence of collision-free hash functions is equivalent to the existence of claw-free pairs of pseudopermutations. We also give a simple construction of collision-free hash functions from everywhere-defined claw-free (pseudo-) permutations.

Key words

CryptographyHash functions

Copyright information

© International Association for Cryptologic Research 1995