[Resource Topic] 2013/359: A heuristic for finding compatible differential paths with application to HAS-160

Welcome to the resource topic for 2013/359

Title:
A heuristic for finding compatible differential paths with application to HAS-160

Authors: Aleksandar Kircanski, Riham AlTawy, Amr M. Youssef

Abstract:

The question of compatibility of differential paths plays a central role in second order collision attacks on hash functions. In this context, attacks typically proceed by starting from the middle and constructing the middle-steps quartet in which the two paths are enforced on the respec- tive faces of the quartet structure. Finding paths that can fit in such a quartet structure has been a major challenge and the currently known compatible paths extend over a suboptimal number of steps for hash functions such as SHA-2 and HAS-160. In this paper, we investigate a heuristic that searches for compatible differential paths. The application of the heuristic in case of HAS-160 yields a practical second order collision over all of the function steps, which is the first practical result that covers all of the HAS-160 steps. An example of a colliding quartet is provided

ePrint: https://eprint.iacr.org/2013/359

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .