Slabiny v konstrukci variant nové hašovací funkce FORK-256
18.09.2006
Krystian Matusiewicz and Scott Contini and Josef Pieprzyk: Collisions for two branches of FORK-256
Abstract. This note presents analysis of the compression function of a recently proposed hash function, FORK-256. We exhibit some unexpected differentials existing for the step transformation and show their possible uses in collision-finding attacks on different simplified variants of FORK-256. Finally, as a concrete application of those observations we present a method of finding chosen IV collisions for a variant of FORK-256 reduced to two branches : either 1 and 2 or 3 and 4.
