FFT-Hash I - Revision history

Fmendel: /* Collision Attacks */

2008-11-10T12:48:29Z

‎Collision Attacks

Fmendel: FFT-HashI moved to FFT-Hash I

2008-11-03T09:32:24Z

FFT-HashI moved to FFT-Hash I

Mschlaeffer at 10:05, 11 March 2008

2008-03-11T10:05:51Z

Mschlaeffer at 10:02, 11 March 2008

2008-03-11T10:02:07Z

Tnad: /* Spezification */

2008-03-10T14:59:35Z

‎Spezification

Tnad at 08:56, 10 March 2008

2008-03-10T08:56:18Z

New page

== Spezification ==



== Cryptanalysis ==

=== Best Known Results ===

----

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

----

=== Collision Attacks ===

----

=== Second Preimage Attacks ===

----

=== Preimage Attacks ===

----

=== Others ===

@@ Line 31: / Line 31: @@
    abstract = {The FFT Hashing Function proposed by C.P. Schnorr [1] hashes messages of arbitrary length into a 128-bit hash value. In this paper, we show that this function is not collision free, and we give an example of two distinct 256-bit messages with the same hash value. Finding a collision (in fact a large family of, colliding messages) requires approximately 223 partial computations of the hash function, and takes a few hours on a SUN3- workstation, and less than an hour on a SPARC-workstation. A similar result discovered independently has been announced at the Asiacrypt’91 rump session by Daemen-Bosselaers-Govaerts-Vandewalle [2].},
    url = {http://link.springer.de/link/service/series/0558/bibs/0658/06580035.htm},
+}
 </bibtex>

@@ Line 23: / Line 23: @@
 <bibtex>
-@INPROCEEDINGS{DBLP:conf/eurocrypt/BaritaudGG92,
+@inproceedings{eurocryptBaritaudGG92,
    author = {Thierry Baritaud and Henri Gilbert and Marc Girault},
    title = {FFT Hashing is not Collision-free},
@@ Line 29: / Line 29: @@
    year = {1992},
    pages = {35-44},
-   abstract = {The FFT Hashing Function proposed by C.P. Schnorr [1] hashes messages
+   abstract = {The FFT Hashing Function proposed by C.P. Schnorr [1] hashes messages of arbitrary length into a 128-bit hash value. In this paper, we show that this function is not collision free, and we give an example of two distinct 256-bit messages with the same hash value. Finding a collision (in fact a large family of, colliding messages) requires approximately 223 partial computations of the hash function, and takes a few hours on a SUN3- workstation, and less than an hour on a SPARC-workstation. A similar result discovered independently has been announced at the Asiacrypt’91 rump session by Daemen-Bosselaers-Govaerts-Vandewalle [2].},
-	of arbitrary length into a 128-bit hash value. In this paper, we
+   url = {http://link.springer.de/link/service/series/0558/bibs/0658/06580035.htm},
+}
 </bibtex>
 ----

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

	=== Collision Attacks ===		=== Collision Attacks ===
		+
		+	<bibtex>
		+	@INPROCEEDINGS{DBLP:conf/eurocrypt/BaritaudGG92,
		+	author = {Thierry Baritaud and Henri Gilbert and Marc Girault},
		+	title = {FFT Hashing is not Collision-free},
		+	booktitle = {EUROCRYPT},
		+	year = {1992},
		+	pages = {35-44},
		+	abstract = {The FFT Hashing Function proposed by C.P. Schnorr [1] hashes messages
		+	of arbitrary length into a 128-bit hash value. In this paper, we
		+	show that this function is not collision free, and we give an example
		+	of two distinct 256-bit messages with the same hash value. Finding
		+	a collision (in fact a large family of, colliding messages) requires
		+	approximately 223 partial computations of the hash function, and
		+	takes a few hours on a SUN3- workstation, and less than an hour on
		+	a SPARC-workstation. A similar result discovered independently has
		+	been announced at the Asiacrypt’91 rump session by Daemen-Bosselaers-Govaerts-Vandewalle
		+	[2].},
		+	bibsource = {DBLP, http://dblp.uni-trier.de},
		+	url = {http://link.springer.de/link/service/series/0558/bibs/0658/06580035.htm}
		+	}
		+	</bibtex>
		+
		+

	----		----

← Older revision		Revision as of 14:59, 10 March 2008
Line 1:		Line 1:
−	== ~~Spezification~~ ==	+	== Specification ==

	<!--		<!--

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