HAVAL - Revision history

Fmendel: /* Second Preimage Attacks */

2008-11-10T09:30:23Z

‎Second Preimage Attacks

2008-11-10T09:30:10Z

‎Second Preimage Attacks

2008-03-11T13:16:41Z

‎Collision Attacks

2008-03-11T07:17:25Z

‎Specification

2008-03-10T18:59:42Z

‎Collision Attacks

2008-03-10T18:59:28Z

‎Collision Attacks

2008-03-10T18:58:46Z

‎Collision Attacks

2008-03-10T16:16:19Z

‎Collision Attacks

2008-03-10T16:16:08Z

‎Collision Attacks

2008-03-10T16:15:19Z

‎Specification

@@ Line 113: / Line 113: @@
+}
 </bibtex>
 ----

← Older revision		Revision as of 09:30, 10 November 2008
Line 96:		Line 96:

	=== Second Preimage Attacks ===		=== Second Preimage Attacks ===
		+
		+	<bibtex>
		+	@inproceedings{fseLeeCKSH08,
		+	author = {Eunjin Lee and Donghoon Chang and Jongsung Kim and Jaechul Sung and Seokhie Hong},
		+	title = {Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL},
		+	booktitle = {FSE},
		+	year = {2008},
		+	pages = {189-206},
		+	abstract = {In 1992, Zheng, Pieprzyk and Seberry proposed a one-way hashing algorithm called HAVAL, which compresses a message of arbitrary length into a digest of 128, 160, 192, 224 or 256 bits. It operates in so called passes where each pass contains 32 steps. The number of passes can be chosen equal to 3, 4 or 5. In this paper, we devise a new differential path of 3-pass HAVAL with probability 2^-114, which allows us to design a second preimage attack on 3-pass HAVAL and partial key recovery attacks on HMAC/NMAC-3-pass HAVAL. Our partial key-recovery attack works with 2^122 oracle queries, 5·2^32 memory bytes and 2^96 3-pass HAVAL computations. },
		+	url = {http://dx.doi.org/10.1007/978-3-540-71039-4_12},
		+	editor = {Kaisa Nyberg},
		+	publisher = {Springer},
		+	series = {LNCS},
		+	volume = {5086},
		+	isbn = {978-3-540-71038-7},
		+	}
		+	</bibtex>
		+
		+

	----		----

@@ Line 37: / Line 37: @@
 === Collision Attacks ===
 <bibtex>
 @inproceedings{fseYuWYP06,

@@ Line 5: / Line 5: @@
 * max. message length: < 2<sup>64</sup> bits
 * compression function: 1024-bit message block, 3/4/5 passes with 256-bit chaining variable
-* Specification:
+* Specification: http://labs.calyptix.com/haval.php
 <bibtex>

@@ Line 39: / Line 39: @@
 <bibtex>
 @inproceedings{fseYuWYP06,
    author    = {Hongbo Yu and Xiaoyun Wang and Aaram Yun and Sangwoo Park},
    title     = {Cryptanalysis of the Full HAVAL with 4 and 5 Passes},

@@ Line 43: / Line 43: @@
    title     = {Cryptanalysis of the Full HAVAL with 4 and 5 Passes},
    pages     = {89-110},
    publisher = {Springer},
    series    = {LNCS},

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

	=== Collision Attacks ===		=== Collision Attacks ===
		+
		+	<bibtex>
		+	@inproceedings{asiacryptRompayBPV03,
		+	author = {Bart Van Rompay and Alex Biryukov and Bart Preneel and Joos Vandewalle},
		+	title = {Cryptanalysis of 3-Pass HAVAL},
		+	pages = {228-245},
		+	url = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2894{\&}spage=228},
		+	editor = {Chi-Sung Laih},
		+	booktitle = {ASIACRYPT},
		+	publisher = {Springer},
		+	series = {LNCS},
		+	volume = {2894},
		+	year = {2003},
		+	isbn = {3-540-20592-6},
		+	abstract = {HAVAL is a cryptographic hash function proposed in 1992 by Zheng, Pieprzyk and Seberry. Its has a structure that is quite similar to other well-known hash functions such as MD4 and MD5. The specification of HAVAL includes a security parameter: the number of passes (that is, the number of times that a particular word of the message is used in the computation) can be chosen equal to 3, 4 or 5. In this paper we describe a practical attack that finds collisions for the 3-pass version of HAVAL. This means that it is possible to generate pairs of messages hashing to the same value. The computational complexity of the attack corresponds to about $2^29$ computations of the compression function of 3-pass HAVAL; the required amount of memory is negligible.},
		+	}
		+	</bibtex>
		+

	----		----

@@ Line 1: / Line 1: @@
 == Specification ==
-<!--
-* digest size: 160 bits
+* digest size: 128,160,192,224,256 bits
 * max. message length: < 2<sup>64</sup> bits
-* compression function: 512-bit message block, 160-bit chaining variable
+* compression function: 1024-bit message block, 3/4/5 passes with 256-bit chaining variable
 * Specification:
 -->
 == Cryptanalysis ==