Collision-free hashfunctions based on blockcipher algorithms

Abstract

The concept of collision free hash functions has been shown to be a useful building block of signature schemes and message authentication schemes. In this paper, a fast and secure proposal is made for a 2n-bit collison free hash function based on an n-bit encryp tion algorithm. In case of the DES, the length of the result is 128 bits, which suffices to thwart a birthday attack.