Difference between revisions of "FFT-Hash I"
From The ECRYPT Hash Function Website
Mschlaeffer (talk | contribs) |
(→Collision Attacks) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 31: | Line 31: | ||
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].}, | 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}, | url = {http://link.springer.de/link/service/series/0558/bibs/0658/06580035.htm}, | ||
| + | editor = {Rainer A. Rueppel}, | ||
| + | series = {LNCS}, | ||
| + | volume = {658}, | ||
| + | year = {1993}, | ||
} | } | ||
</bibtex> | </bibtex> | ||
Latest revision as of 14:48, 10 November 2008
Contents
1 Specification
2 Cryptanalysis
2.1 Best Known Results
2.2 Generic Attacks
2.3 Collision Attacks
Thierry Baritaud, Henri Gilbert, Marc Girault - FFT Hashing is not Collision-free
- EUROCRYPT 658:35-44,1993
- http://link.springer.de/link/service/series/0558/bibs/0658/06580035.htm
BibtexAuthor : Thierry Baritaud, Henri Gilbert, Marc Girault
Title : FFT Hashing is not Collision-free
In : EUROCRYPT -
Address :
Date : 1993
