FFT-hash II, efficient cryptographic hashing

Authors:
C. P. Schnorr
Affiliations:
Fachbereich Mathematik, Informatik, Universität Frankfurt
Venue:
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Year:
1992

Citing 0
Cited 3

FFT-Hash-II is not yet Collision-free

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On Differential Properties of Pseudo-Hadamard Transform and Related Mappings

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
CS-Cipher

FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

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.