FORK-256 - Revision history

Fmendel: FORK256 moved to FORK-256

2008-11-03T09:30:11Z

FORK256 moved to FORK-256

Fmendel: /* Specification */

2008-03-12T09:13:48Z

‎Specification

Fmendel: /* Others */

2008-03-11T10:16:39Z

‎Others

Mschlaeffer at 09:18, 11 March 2008

2008-03-11T09:18:59Z

Tnad: /* Collision Attacks */

2008-03-11T09:02:48Z

‎Collision Attacks

Tnad: /* Collision Attacks */

2008-03-11T09:02:20Z

‎Collision Attacks

Tnad: /* Specification */

2008-03-11T08:20:16Z

‎Specification

Fmendel: /* Specification */

2008-03-11T07:14:26Z

‎Specification

Fmendel: /* Specification */

2008-03-11T07:14:12Z

‎Specification

Fmendel: /* Specification */

2008-03-11T07:13:53Z

‎Specification

@@ Line 29: / Line 29: @@
 </bibtex>
 <bibtex>
 @MISC{nistHongSHLM05,
@@ Line 39: / Line 40: @@
+}
 </bibtex>
 == Cryptanalysis ==

← Older revision		Revision as of 10:16, 11 March 2008
Line 108:		Line 108:

	=== Others ===		=== Others ===
		+	<bibtex>
		+	@inproceedings{indocryptSaarinen07a,
		+	author = {Markku-Juhani Olavi Saarinen},
		+	title = {A Meet-in-the-Middle Collision Attack Against the New FORK-256},
		+	booktitle = {INDOCRYPT},
		+	year = {2007},
		+	pages = {10-17},
		+	url = {http://dx.doi.org/10.1007/978-3-540-77026-8_2},
		+	editor = {K. Srinathan and C. Pandu Rangan and Moti Yung},
		+	publisher = {Springer},
		+	series = {LNCS},
		+	volume = {4859},
		+	isbn = {978-3-540-77025-1},
		+	abstract = {We show that a 2112.9 collision attack exists against the FORK-256 Hash Function. The attack is surprisingly simple compared to existing published FORK-256 cryptanalysis work, yet is the best known result against the new, tweaked version of the hash. The attack is based on â€œsplittingâ€ the message schedule and compression function into two halves in a meet-in-the-middle attack. This in turn reduces the space of possible hash function results, which leads to significantly faster collision search. The attack strategy is also applicable to the original version of FORK-256 published in FSE 2006.},
		+	}
		+	</bibtex>

@@ Line 4: / Line 4: @@
 * max. message length: < 2<sup>64</sup> bits
 * compression function: 512-bit message block, 4 streams with each 256-bit chaining variable
 * Specification: http://csrc.nist.gov/groups/ST/hash/documents/Sung_FORK-256.pdf
 <bibtex>

← Older revision		Revision as of 09:02, 11 March 2008
Line 51:		Line 51:

	=== Collision Attacks ===		=== Collision Attacks ===
		+	<bibtex>
		+	@inproceedings{fseMatusiewiczPBCP07,
		+	author = {Krystian Matusiewicz and Thomas Peyrin and Olivier Billet and Scott Contini and Josef Pieprzyk},
		+	title = {Cryptanalysis of FORK-256},
		+	pages = {19-38},
		+	url = {http://dx.doi.org/10.1007/978-3-540-74619-5_2},
		+	editor = {Alex Biryukov},
		+	booktitle = {FSE},
		+	publisher = {Springer},
		+	series = {LNCS},
		+	volume = {4593},
		+	year = {2007},
		+	isbn = {978-3-540-74617-1},
		+	abstract = {In this paper we present a cryptanalysis of a
		+	new 256-bit hash function, FORK-256, proposed by Hong et al. at
		+	FSE 2006. This cryptanalysis is based on some unexpected differentials
		+	existing for the step transformation. We show their possible uses in
		+	different attack scenarios by giving a 1-bit (resp. 2-bit) near collision
		+	attack against the full compression function of FORK-256 running with
		+	complexity of 2<sup>125</sup> (resp. 2<sup>120</sup>) and with negligible memory, and by exhibiting
		+	a 22-bit near pseudo-collision. We also show that we can find collisions for
		+	the full compression function with a small amount of memory with complexity not
		+	exceeding 2<sup>126.6</sup> hash evaluations. We further show how to reduce this complexity
		+	to 2<sup>109.6</sup> hash computations by using 2<sup>73</sup> memory words. Finally, we show that
		+	this attack can be extended with no additional cost to find collisions for the
		+	full hash function, i.e. with the predefined IV.},
		+	}
		+	</bibtex>

	<bibtex>		<bibtex>

@@ Line 63: / Line 63: @@
    volume    = {4377},
    isbn      = {3-540-69327-0},
-   url       = {http:/dx.doi.org/10.1007/11967668_6},
+   url       = {http://dx.doi.org/10.1007/11967668_6},
    abstract  = {FORK-256 is a hash function presented at FSE 2006. Whereas SHA-like designs process messages in one stream, FORK-256 uses four parallel streams for hashing. In this article, we present the first cryptanalytic results on this design strategy. First, we study a linearized variant of FORK-256, and show several unusual properties of this linearized variant. We also explain why the linearized model can not be used to mount attacks similar to the recent attacks by Wang et al. on SHA-like hash functions. Second, we show how collision attacks, exploiting the non-bijectiveness of the nonlinear functions of FORK-256, can be mounted on reduced variants of FORK-256. We show an efficient attack on FORK-256 reduced to 2 streams and present actual colliding pairs. We expect that our attack can also be extended to FORK-256 reduced to 3 streams. For the moment our approach does not appear to be applicable to the full FORK-256 hash function.} }
 </bibtex>

← Older revision	Revision as of 09:30, 3 November 2008
(No difference)

@@ Line 1: / Line 1: @@
 == Specification ==
-<!--
+* digest size: 256 bits
 * max. message length: < 2<sup>64</sup> bits
-* compression function: 512-bit message block, 160-bit chaining variable
+* compression function: 512-bit message block, 4 streams with each 256-bit chaining variable
 * Specification: http://csrc.nist.gov/groups/ST/hash/documents/Sung_FORK-256.pdf