Paper 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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. INDOCRYPT 2007
- Keywords
- FORK-256Hash Function CryptanalysisMeet-in-the-middle
- Contact author(s)
- m saarinen @ rhul ac uk
- History
- 2007-09-25: revised
- 2007-09-19: received
- See all versions
- Short URL
- https://ia.cr/2007/373
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/373,
author = {Markku-Juhani O. Saarinen},
title = {A Meet-in-the-Middle Collision Attack Against the New {FORK}-256},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/373},
year = {2007},
url = {https://eprint.iacr.org/2007/373}
}
