In a paper published in FSE 2007, a way of obtaining nearcollisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained examples of near-collisions for the compression function, but in practice the attack could not be extended to the full function due to large memory requirements and computation time. In this paper we improve the attack and show that it is possible to find near-collisions in practice for any given value of IV. In particular, this means that the full hash function with the prespecified IV is vulnerable in practice, not just in theory. We exhibit an example near-collision for the complete hash function. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Contini, S., Matusiewicz, K., & Pieprzyk, J. (2007). Extending FORK-256 attack to the full hash function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4861 LNCS, pp. 296–305). Springer Verlag. https://doi.org/10.1007/978-3-540-77048-0_23
Mendeley helps you to discover research relevant for your work.