FFT-Hash-II is not yet Collision-free (1992)
| Citations: | 7 - 1 self |
BibTeX
@MISC{Vaudenay92fft-hash-iiis,
author = {S. Vaudenay and Serge Vaudenay and Where P},
title = {FFT-Hash-II is not yet Collision-free},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. In this paper, we show that the FFT-Hash function proposed by Schnorr [2] is not collision free. Finding a collision requires about 2 24 computation of the basic function of FFT. This can be done in few hours on a SUN4-workstation. In fact, it is at most as strong as a one-way hash function which returns a 48 bits length value. Thus, we can invert the proposed FFT hash-function with 2 48 basic computations. Some simple improvements of the FFT hash function are also proposed to try to get rid of the weaknesses of FFT. History The first version of FFT-Hashing was proposed by Schnorr during the rump session of Crypto'91 [1]. This function has been shown not to be collision free at Eurocrypt'92 [3]. An improvement of the function has been proposed the same day [2] without the weaknesses discovered. However, FFT-Hashing has still some other weaknesses as it is proved in this paper. 1 FFT-Hash-II, Notations The FFT-hash function is built on a basic function ! : ? which takes one 128b...
Citations
| 8 | FFT–Hash II, efficient cryptographic hashing - Schnorr - 1992 |
| 6 | FFT-hash, an efficient cryptographic hash function - Schnorr - 1991 |
| 1 | FFT Hashing is not Collision-free. Presented at the EUROCRYPT'92 Conference (unpublished) This article was processed using the L a T E X macro package with LLNCS style - Baritaud, Gilbert, et al. |
