Cryptology ePrint Archive: Report 2007/373

A Meet-in-the-Middle Collision Attack Against the New FORK-256

Markku-Juhani O. Saarinen

Abstract: We show that a $2^{112.9}$ collision attack exists against the FORK-256 Hash Function. The attack is surprisingly simple compared to existing published FORK-256 cryptanalysis work, yet is the best known result against the new, tweaked version of the hash. The attack is based on "splitting" the message schedule and compression function into two halves in a meet-in-the-middle attack. This in turn reduces the space of possible hash function results, which leads to significantly faster collision search. The attack strategy is also applicable to the original version of FORK-256 published in FSE 2006.

Category / Keywords: secret-key cryptography / FORK-256, Hash Function Cryptanalysis, Meet-in-the-middle

Publication Info: INDOCRYPT 2007

Date: received 16 Sep 2007, last revised 25 Sep 2007

Contact author: m saarinen at rhul ac uk

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20070925:074712 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]