Vaudenay, Serge2007-01-182007-01-182007-01-18199210.1007/3-540-48071-4_43https://infoscience.epfl.ch/handle/20.500.14299/239648This paper, shows that for the FFT-hash function proposed by Schnorr (1992), finding a collision requires about 2²⁴ computations of the basic FFT function. This can be done in few hours on SUN4-workstation. The proposed FFT hash-function can be inverted with 2⁴⁸ basic computations. Some simple improvements are proposed to try to get rid of the weaknessestext::conference output::conference proceedings::conference paper