Preimage Attack on the Parallel FFT-Hashing Function
- Cite this paper as:
- Chang D., Yung M., Sung J., Hong S., Lee S. (2007) Preimage Attack on the Parallel FFT-Hashing Function. In: Pieprzyk J., Ghodosi H., Dawson E. (eds) Information Security and Privacy. ACISP 2007. Lecture Notes in Computer Science, vol 4586. Springer, Berlin, Heidelberg
The parallel FFT-Hashing function 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 the parallel FFT-Hashing function using 2t + 64 + 2128 − t time complexity and 2t memory, which is less than the generic complexity 2128. Specifically, when t = 32 , we can find a preimage using 297 time and 232 memory. Our method can be described as “disseminative-meet-in-the-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 the parallel FFT-Hashing function has some weaknesses when preimage attack is considered (and relevant). To the best of our knowledge,this is the first attack on the parallel FFT-Hashing function.
KeywordsCryptographic Hash Function Preimage Attack the Parallel FFT-Hashing function
Unable to display preview. Download preview PDF.