FFT-Hash II, Efficient Cryptographic Hashing

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 658)


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.


Hash Function Discrete Fourier Transform Final Configuration Primitive Root Polynomial Transformation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  1. 1.Fachbereich Mathematik / InformatikUniversität FrankfurtFrankfurt

Personalised recommendations