@inproceedings{d5d0567d9eb14a37ae2017734e1f96c4,
title = "Extending FORK-256 attack to the full hash function",
abstract = "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.",
author = "Scott Contini and Krystian Matusiewicz and Josef Pieprzyk",
year = "2007",
language = "English",
isbn = "9783540770473",
volume = "4861 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "296--305",
editor = "Sihan Qing and Hideki Imai and Guilin Wang",
booktitle = "Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings",
address = "United States",
note = "9th International Conference on Information and Communications Security, ICICS 2007 ; Conference date: 12-12-2007 Through 15-12-2007",
}