Publication
FFT-hash-II is not yet collision-free
Abstract
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
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.