FFT-hash II, efficient cryptographic hashing

Abstract

We propose an efficient algorithm that hashes messages of arbitrary bit length into an 128 bit hash value. The algorithm is designed to make the production of a pair of colliding messages computationally infeasible. The algorithm performs a discrete Fourier transform and a polynomial recursion over a finite field. Each hash value in {0, 1}128 occurs with frequency at most 2−120. This hash function is an improved variant of the algorithm FFT-hash I presented in the rump session of CRYPTO’91.