### Abstract

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 2^{t+64} + 2 ^{128-t} time complexity and 2^{t} memory, which is less than the generic complexity 2^{128}. Specifically, when t = 32, we can find a preimage using 2^{97} time and 2^{32} 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.

Original language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Pages | 59-67 |

Number of pages | 9 |

Volume | 4586 LNCS |

Publication status | Published - 2007 Dec 1 |

Event | 12th Australasian Conference on Information Security and Privacy, ACISP2007 - Townsville, Australia Duration: 2007 Jul 2 → 2007 Jul 4 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 4586 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 12th Australasian Conference on Information Security and Privacy, ACISP2007 |
---|---|

Country | Australia |

City | Townsville |

Period | 07/7/2 → 07/7/4 |

### Fingerprint

### Keywords

- Cryptographic hash function
- Preimage attack
- The parallel FFT-hashing function

### ASJC Scopus subject areas

- Biochemistry, Genetics and Molecular Biology(all)
- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 4586 LNCS, pp. 59-67). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4586 LNCS).

**Preimage attack on the parallel FFT-hashing function.** / Donghoon, Chang; Moti, Yung; Jaechul, Sung; Hong, Seokhie; Lee, Sangjin.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 4586 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4586 LNCS, pp. 59-67, 12th Australasian Conference on Information Security and Privacy, ACISP2007, Townsville, Australia, 07/7/2.

}

TY - GEN

T1 - Preimage attack on the parallel FFT-hashing function

AU - Donghoon, Chang

AU - Moti, Yung

AU - Jaechul, Sung

AU - Hong, Seokhie

AU - Lee, Sangjin

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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 + 2 128-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.

AB - 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 + 2 128-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.

KW - Cryptographic hash function

KW - Preimage attack

KW - The parallel FFT-hashing function

UR - http://www.scopus.com/inward/record.url?scp=38149101695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149101695&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38149101695

SN - 3540734570

SN - 9783540734574

VL - 4586 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 59

EP - 67

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -