Extending FORK-256 attack to the full hash function
Contini, Scott, Matusiewicz, Krystian, & Pieprzyk, Josef (2007) Extending FORK-256 attack to the full hash function. Lecture Notes in Computer Science, 4861, pp. 296-305.
In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions for the FORK-256 hash function was presented . 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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||Information and Communications Security : 9th International Conference, ICICS 2007, Zhengzhou, China, December 12-15, 2007. Proceedings|
|Divisions:||Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Deposited On:||08 Jul 2014 01:43|
|Last Modified:||15 Jul 2014 02:35|
Repository Staff Only: item control page