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 2<sup>24</sup> 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<sup>48</sup> basic computations. Some simple improvements are proposed to try to get rid of the weaknesses


Published in:
Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, 740, 587-593
Presented at:
Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992
Year:
1992
Laboratories:




 Record created 2007-01-18, last modified 2018-03-17

n/a:
Download fulltext
PS

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)