Infoscience

Conference paper

FFT-hash-II is not yet collision-free

This paper, shows that for the FFT-hash function proposed by Schnorr (1992), finding a collision requires about 224 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 248 basic computations. Some simple improvements are proposed to try to get rid of the weaknesses

    Reference

    • LASEC-CONF-1993-001

    Record created on 2007-01-18, modified on 2016-08-08

Related material