Preimage attack on the parallel FFT-hashing function

Chang Donghoon, Yung Moti, Sung Jaechul, Seokhie Hong, Sangjin Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages59-67
Number of pages9
Volume4586 LNCS
Publication statusPublished - 2007 Dec 1
Event12th Australasian Conference on Information Security and Privacy, ACISP2007 - Townsville, Australia
Duration: 2007 Jul 22007 Jul 4

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4586 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th Australasian Conference on Information Security and Privacy, ACISP2007
CountryAustralia
CityTownsville
Period07/7/207/7/4

Fingerprint

Hashing
Fast Fourier transforms
Attack
Collision Attack
Weights and Measures
Permutation
Data storage equipment
Time Complexity
Demonstrate

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

Donghoon, C., Moti, Y., Jaechul, S., Hong, S., & Lee, S. (2007). Preimage attack on the parallel FFT-hashing function. In 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.

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Donghoon, C, Moti, Y, Jaechul, S, Hong, S & Lee, S 2007, Preimage attack on the parallel FFT-hashing function. in 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.
Donghoon C, Moti Y, Jaechul S, Hong S, Lee S. Preimage attack on the parallel FFT-hashing function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4586 LNCS. 2007. p. 59-67. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Donghoon, Chang ; Moti, Yung ; Jaechul, Sung ; Hong, Seokhie ; Lee, Sangjin. / Preimage attack on the parallel FFT-hashing function. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4586 LNCS 2007. pp. 59-67 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1b5c53c40c934f1eb46f87976920b902,
title = "Preimage attack on the parallel FFT-hashing function",
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 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.",
keywords = "Cryptographic hash function, Preimage attack, The parallel FFT-hashing function",
author = "Chang Donghoon and Yung Moti and Sung Jaechul and Seokhie Hong and Sangjin Lee",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "3540734570",
volume = "4586 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "59--67",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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 -