FFT-Hash II - Revision history

Fmendel: /* Specification */

2008-11-10T12:59:29Z

‎Specification

Fmendel: FFT-Hash-II moved to FFT-Hash II

2008-11-03T09:33:06Z

FFT-Hash-II moved to FFT-Hash II

Crechberger: /* Collision Attacks */

2008-03-11T10:31:26Z

‎Collision Attacks

Mschlaeffer at 10:14, 11 March 2008

2008-03-11T10:14:34Z

Mschlaeffer at 10:13, 11 March 2008

2008-03-11T10:13:22Z

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 ===

@@ Line 17: / Line 17: @@
    abstract = {We propose an efficient algorithm that hashes messages of arbitrary bit length into an 128 bit hash value. The algorithm is designed to make the production of a pair of colliding messages computationally infeasible. The algorithm performs a discrete Fourier transform and a polynomial recursion over a finite field. Each hash value in {0, 1}128 occurs with frequency at most 2-120. This hash function is an improved variant of the algorithm FFT-hash I presented in the rump session of CRYPTO’91.},
    url = {http://link.springer.de/link/service/series/0558/bibs/0658/06580045.htm},
+}
 </bibtex>

← Older revision		Revision as of 10:31, 11 March 2008
Line 34:		Line 34:
	=== Collision Attacks ===		=== Collision Attacks ===

		+	<bibtex>
		+	@inproceedings{cryptoVaudenay92,
		+	author = {Serge Vaudenay},
		+	title = {FFT-Hash-II is not yet Collision-free},
		+	booktitle = {CRYPTO},
		+	year = {1992},
		+	pages = {587-593},
		+	url = {http://link.springer.de/link/service/series/0558/bibs/0740/07400587.htm},
		+	editor = {Ernest F. Brickell},
		+	publisher = {Springer},
		+	series = {LNCS},
		+	volume = {740},
		+	isbn = {3-540-57340-2},
		+	}
		+	</bibtex>
	----		----

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

@@ Line 7: / Line 7: @@
 * Specification:
 -->
 == Cryptanalysis ==