Difference between revisions of "FFT-Hash I"

Latest revision as of 14:48, 10 November 2008

Thierry Baritaud, Henri Gilbert, Marc Girault - FFT Hashing is not Collision-free

EUROCRYPT 658:35-44,1993

Author : Thierry Baritaud, Henri Gilbert, Marc Girault
Title : FFT Hashing is not Collision-free
In : EUROCRYPT -
Address :
Date : 1993

@@ Line 21: / Line 21: @@
 === Collision Attacks ===
+<bibtex>
+@inproceedings{eurocryptBaritaudGG92,
+  author = {Thierry Baritaud and Henri Gilbert and Marc Girault},
+  title = {FFT Hashing is not Collision-free},
+  booktitle = {EUROCRYPT},
+  year = {1992},
+  pages = {35-44},
+  abstract = {The FFT Hashing Function proposed by C.P. Schnorr [1] hashes messages of arbitrary length into a 128-bit hash value. In this paper, we show that this function is not collision free, and we give an example of two distinct 256-bit messages with the same hash value. Finding a collision (in fact a large family of, colliding messages) requires approximately 223 partial computations of the hash function, and takes a few hours on a SUN3- workstation, and less than an hour on a SPARC-workstation. A similar result discovered independently has been announced at the Asiacrypt’91 rump session by Daemen-Bosselaers-Govaerts-Vandewalle [2].},
+  url = {http://link.springer.de/link/service/series/0558/bibs/0658/06580035.htm},
+  editor    = {Rainer A. Rueppel},
+  series    = {LNCS},
+  volume    = {658},
+  year      = {1993},
+}
+</bibtex>
 ----