This 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 weaknesses