FSB - Revision history

Fmendel: /* Collision Attacks */

2008-11-10T09:59:12Z

‎Collision Attacks

Mschlaeffer at 10:38, 11 March 2008

2008-03-11T10:38:53Z

Mschlaeffer at 10:26, 11 March 2008

2008-03-11T10:26:43Z

Fmendel at 10:20, 11 March 2008

2008-03-11T10:20:44Z

Fmendel at 10:19, 11 March 2008

2008-03-11T10:19:43Z

New page

== Specification ==



== Cryptanalysis ==

=== Best Known Results ===

----

=== Generic Attacks ===
* [[GenericAttacksMerkleDamgaard| Generic Attacks on the Merkle-Damgaard Construction ]]

----

=== Collision Attacks ===

----

=== Second Preimage Attacks ===

----

=== Preimage Attacks ===

----

=== Others ===

← Older revision		Revision as of 09:59, 10 November 2008
Line 49:		Line 49:

	=== Collision Attacks ===		=== Collision Attacks ===
		+
		+	<bibtex>
		+	@inproceedings{ctrsaFouqueL08,
		+	author = {Pierre-Alain Fouque and Ga{\"e}tan Leurent},
		+	title = {Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes},
		+	booktitle = {CT-RSA},
		+	year = {2008},
		+	pages = {19-35},
		+	url = {http://dx.doi.org/10.1007/978-3-540-79263-5_2},
		+	abstract = {At the ECRYPT Hash Workshop 2007, Finiasz, Gaborit, and Sendrier proposed an improved version of a previous provably secure syndrome-based hash function. The main innovation of the new design is the use of a quasi-cyclic code in order to have a shorter description and to lower the memory usage. In this paper, we look at the security implications of using a quasi-cyclic code. We show that this very rich structure can be used to build a highly efficient attack: with most parameters, our collision attack is faster than the compression function! },
		+	editor = {Tal Malkin},
		+	publisher = {Springer},
		+	series = {LNCS},
		+	volume = {4964},
		+	isbn = {978-3-540-79262-8},
		+	}
		+	</bibtex>

	<bibtex>		<bibtex>

@@ Line 7: / Line 7: @@
 * Specification:
 -->
 <bibtex>

← Older revision		Revision as of 10:20, 11 March 2008
Line 21:		Line 21:

	=== Collision Attacks ===		=== Collision Attacks ===
		+
		+	<bibtex>
		+	@inproceedings{indocryptSaarinen07,
		+	author = {Markku-Juhani Olavi Saarinen},
		+	title = {Linearization Attacks Against Syndrome Based Hashes},
		+	booktitle = {INDOCRYPT},
		+	year = {2007},
		+	pages = {1-9},
		+	url = {http://dx.doi.org/10.1007/978-3-540-77026-8_1},
		+	editor = {K. Srinathan and C. Pandu Rangan and Moti Yung},
		+	publisher = {Springer},
		+	series = {LNCS},
		+	volume = {4859},
		+	isbn = {978-3-540-77025-1},
		+	abstract = {In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory problem with hard average-case complexity. In the ECRYPT 2007 Hash Function Workshop, new versions with essentially the same compression function but radically different security parameters and an additional final transformation were presented. We show that hardness of average-case complexity of the underlying problem is irrelevant in collision search by presenting a linearization method that can be used to produce collisions in a matter of seconds on a desktop PC for the variant of FSB with claimed 2^{128} security.},
		+	}
		+	</bibtex>

	----		----