Contents

FORK-256

Hash algorithm

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (October 2016)

FORK-256 is a hash algorithm designed in response to security issues discovered in the earlier SHA-1 and MD5 algorithms. After substantial cryptanalysis, the algorithm is considered broken.

In 2005, Xiaoyun Wang announced an order-${\displaystyle 2^{63}}$ collision attack on the government's hash standard SHA-1.^[1][2] The National Institute of Standards and Technology (NIST), the body responsible for setting cryptographic standards in the United States, concluded this was a practical attack (as previous estimates were order-${\displaystyle 2^{80}}$) and began encouraging additional research into hash functions and their weaknesses.^[3] As part of this effort, NIST hosted two workshops where potential new algorithms, including FORK-256, were introduced and discussed.^[4] Rather than immediately select any of these algorithms, NIST conducted a public competition from 2007–2012 which ultimately resulted in the Keccak algorithm being selected for use as the SHA-3 standard.^[5]

FORK-256 was introduced at the 2005 NIST Hash workshop and published the following year.^[6] FORK-256 uses 512-bit blocks and implements preset constants that change after each repetition. Each block is hashed into a 256-bit block through four branches that divides each 512 block into sixteen 32-bit words that are further encrypted and rearranged.

The initial algorithm garnered significant cryptanalysis, summarized in (Saarinen 2007).^[7] Matusiewicz et al. (2006) discovered a collision attack with complexityof${\displaystyle 2^{126.6}}$.^[8] Mendel et al. (2006) independently derived a similar attack.^[9] The following year Matusiewicz's team improved their attack to no worse than ${\displaystyle 2^{108},}$^[10] and (Contini 2007) demonstrated a practical implementation of the attack.^[11]

In response to these attacks, Hong and his team proposed an improved version of FORK-256.^[12] Markku-Juhani Saarinen derived a ${\displaystyle 2^{112.9}}$-complexity attack again the improved algorithm.^[7] By way of comparison, the eventual SHA-3 standard withstands up to an order-${\displaystyle 2^{128}}$ attack.^{[citation needed]}

FORK-256 was added to the Botan cryptographic library after its introduction. Botan developer Jack Lloyd removed the algorithm in 2010 after concluding the hash suffered from several weaknesses and had never become widely used.^[13]

This cryptography-related article is a stub. You can help Wikipedia by expanding it.