Extending FORK-256 attack to the full hash function

Scott Contini*, Krystian Matusiewicz, Josef Pieprzyk

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationInformation and Communications Security - 9th International Conference, ICICS 2007, Proceedings
EditorsSihan Qing, Hideki Imai, Guilin Wang
Place of PublicationBerlin ; New York
PublisherSpringer, Springer Nature
Pages296-305
Number of pages10
Volume4861 LNCS
ISBN (Print)9783540770473
Publication statusPublished - 2007
Event9th International Conference on Information and Communications Security, ICICS 2007 - Zhengzhou, China
Duration: 12 Dec 200715 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4861 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other9th International Conference on Information and Communications Security, ICICS 2007
CountryChina
CityZhengzhou
Period12/12/0715/12/07

Fingerprint Dive into the research topics of 'Extending FORK-256 attack to the full hash function'. Together they form a unique fingerprint.

Cite this