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 respective 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. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Kircanski, A., AlTawy, R., & Youssef, A. M. (2013). A heuristic for finding compatible differential paths with application to HAS-160. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8270 LNCS, pp. 464–483). https://doi.org/10.1007/978-3-642-42045-0_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
