Parallel FFT-Hashing

Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multi-permutation which helps in proving its resistance to collision attacks. In this work we show a preimage attack on Parallel FFT-Hashing with complexity 2t+64 + 2128−t and memory 2t which is less than the generic complexity 2128 . When t = 32, we can find a preimage with complexity 297 and memory 232 . Our method can be described as “disseminative-meet-inthe-middle-attack” we actually use the properties of multi-permutation (helpful against collision attack) to our advantage in the attack. Overall, this type of attack (beating the generic one) demonstrates that the structure of Parallel FFT-Hashing has some weaknesses when preimage attack is considered. To the best of our knowledge, this is the first attack on Parallel FFT-Hashing. Keywords : Cryptographic Hash Function, Preimage Attack, parallel F...

• Type: Conference
• Year: 1993
• Where: FSE
• Authors: Claus-Peter Schnorr, Serge Vaudenay
• Keywords: Collision Attack, Cryptology, FSE 1993, Parallel FFT-Hashing, Preimage Attack