FSB (SHA-3 submission) - Revision history

Crechberger: Added Bernstein et al. implementation of generic attack against FSB

2009-07-20T12:20:18Z

Added Bernstein et al. implementation of generic attack against FSB

Fmendel at 10:12, 26 January 2009

2009-01-26T10:12:27Z

Fmendel: /* The algorithm */

2008-12-11T09:20:31Z

‎The algorithm

JAumasson at 15:41, 13 November 2008

2008-11-13T15:41:07Z

New page

== The algorithm ==

* Author(s): Daniel Augot, Matthieu Finiasz, Philippe Gaborit, Stéphane Manuel, Nicolas Sendrier
* Website: [http://www-rocq.inria.fr/secret/CBCrypto/index.php?pg=fsb http://www-rocq.inria.fr/secret/CBCrypto/index.php?pg=fsb]
* Specification:

<bibtex>
@misc{sha3AFGMS08,
author = {Daniel Augot and Matthieu Finiasz and Philippe Gaborit and Stéphane Manuel and Nicolas Sendrier},
title = {SHA-3 proposal: FSB},
url = {http://www-rocq.inria.fr/secret/CBCrypto/fsbdoc.pdf},
howpublished = {Submission to NIST},
year = {2008},
}
</bibtex>

== Cryptanalysis ==

* None yet

← Older revision		Revision as of 12:20, 20 July 2009
Line 19:		Line 19:
	== Cryptanalysis ==		== Cryptanalysis ==

−	* None yet	+	<bibtex>
		+	@misc{cryptoeprint:2009:292,
		+	author = {Daniel J. Bernstein and Tanja Lange and Christiane Peters and Ruben Niederhagen and Peter Schwabe},
		+	title = {Implementing Wagner's generalized birthday attack against the SHA-3 candidate FSB},
		+	howpublished = {Cryptology ePrint Archive, Report 2009/292},
		+	year = {2009},
		+	note = {\url{http://eprint.iacr.org/}},
		+	url = {http://eprint.iacr.org/2009/292.pdf},
		+	abstract = {The hash function FSB is one of the candidates submitted to NIST's competition to find the new standard hash function, SHA-3. The compression function of FSB is based on error correcting codes. In this paper we show how to use Wagner's generalized birthday attack to find collisions in FSB's compression function. In particular, we present details on our implementation attacking FSB_48, a toy version of FSB which was proposed by the FSB submitters as a training case for FSB. Our attack does not make use of any properties of the particular linear code used within FSB. FSB_48 was chosen as a target where generalized birthday attacks would be one of the strongest attacks and which could be attacked in practice.
		+
		+	We show how to adapt this attack so that it runs on our computer cluster of only 10 PCs which provides far less memory than the usual implementation of generalized birthday attacks would require. This situation is very interesting for estimating the security of systems against distributed attacks using contributed off-the-shelf PCs.
		+
		+	For the SHA-3 competition this result is meaningful in that it allows to assess the security of FSB against the strongest non-structural attack; it does not provide any insight in the security of this particular choice of linear code. }
		+	}
		+	}
		+	</bibtex>

@@ Line 4: / Line 4: @@
 * Website: [http://www-rocq.inria.fr/secret/CBCrypto/index.php?pg=fsb http://www-rocq.inria.fr/secret/CBCrypto/index.php?pg=fsb]
 * NIST submission package: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/FSB.zip FSB.zip]
-* Specification:
 <bibtex>
@@ Line 15: / Line 15: @@
+}
 </bibtex>
 == Cryptanalysis ==
 * None yet