To obtain these results, we extend the meet-in-the-middle framework recently developed by Aoki and Sasaki in a series of papers. In addition to various algorithm-specific techniques, we use a number of conceptually new ideas that are applicable to a larger class of constructions. Among them are (1) incorporating multi-target scenarios into the MITM framework, leading to faster preimages from pseudo-preimages, (2) a simple precomputation technique that allows for finding new preimages at the cost of a single pseudo-preimage, and (3) probabilistic initial structures, compared with deterministic ones, to enable more neutral words, and hence to reduce the attack time complexity. All the techniques developed await application to other hash functions. To illustrate this, we give as another example improved preimage attacks on SHA-2 members.
Category / Keywords: secret-key cryptography / Preimage, MD4, Tiger, SHA-2, Hash function, Cryptanalysis, Meet-in-the-Middle Publication Info: A short version of the paper will appear in ASIACRYPT 2010 Date: received 12 Jan 2010, last revised 3 Sep 2010 Contact author: ntu guo at gmail com Available formats: PDF | BibTeX Citation Note: An error on the preimage attack against MD4 has been corrected. Version: 20100903:073303 (All versions of this report) Discussion forum: Show discussion | Start new discussion