Sarmal - Revision history

JAumasson: Added the Mouha/Bjørstad/Preneel result

2009-04-16T17:00:18Z

Added the Mouha/Bjørstad/Preneel result

Mschlaeffer: added preimage attack with chosen salt

2009-01-21T15:23:29Z

added preimage attack with chosen salt

Fmendel at 19:58, 29 December 2008

2008-12-29T19:58:59Z

Mschlaeffer: Collisions and Pseudo-Collisions for Sarmal

2008-12-19T10:06:29Z

Collisions and Pseudo-Collisions for Sarmal

Fmendel: /* The algorithm */

2008-12-11T09:26:54Z

‎The algorithm

JAumasson at 23:30, 4 December 2008

2008-12-04T23:30:33Z

Fmendel: /* Cryptanalysis */

2008-12-01T11:03:05Z

‎Cryptanalysis

Fmendel: /* Cryptanalysis */

2008-12-01T11:02:50Z

‎Cryptanalysis

Fmendel: /* Cryptanalysis */

2008-12-01T10:54:55Z

‎Cryptanalysis

JAumasson at 14:31, 25 November 2008

2008-11-25T14:31:27Z

@@ Line 30: / Line 30: @@
 |-
 |   | preimage with salt || hash || 384,512 ||  || 2<sup>n-128+x</sup> || 2<sup>128-x</sup> || [http://ehash.iaik.tugraz.at/uploads/d/d1/Salt-collision.pdf Mendel,Schläffer]
 |-
 |}
@@ Line 56: / Line 58: @@
    abstract  = {In this paper, we show a collision attack on the hash function of Sarmal with different salt. The attack has a complexity of $2^{n/3}$ compression function evaluations and memory requirement of $2^{n/3}$. Since the salt of Sarmal is only 256 bits the attack works only for variants of Sarmal up to 384 bits. Note that we can choose the messages in our attack and hence we can even construct meaningful collisions for the hash function.
 Furthermore, we show how to construct preimages for Sarmal faster than brute force search if the attacker can choose the salt value. The attack works for all output sizes of Sarmal and with a complexity of $2^{n/2+x}$ compression function evaluations and memory requirements of $2^{n/2-x}$ for $n=\{224,256\}$, and $2^{n-128+x}$ compression function evaluations and memory requirements of $2^{128-x}$ for $n=\{384,512\}$.},
+}
 </bibtex>

@@ Line 26: / Line 26: @@
 |-
 |   | collision with salt || hash || 224,256,384 ||  || 2<sup>n/3</sup> || 2<sup>n/3</sup> || [http://ehash.iaik.tugraz.at/uploads/d/d1/Salt-collision.pdf Mendel,Schläffer]
 |-
 |}
@@ Line 46: / Line 50: @@
 @misc{sarmalMS08,
    author    = {Florian Mendel and Martin Schläffer},
-   title     = {Collisions and Pseudo-Collisions for Sarmal},
+   title     = {Collisions and Preimages for Sarmal},
    url        = {http://ehash.iaik.tugraz.at/uploads/d/d1/Salt-collision.pdf},
    howpublished = {Available online},
    year      = {2008},
-   abstract  = {In this paper, we show a collision attack on the hash function of Sarmal with different salt. The attack has a complexity of 2^{n/3} compression function evaluations and memory requirement of 2^{n/3}. Since the salt of Sarmal is only 256 bits the attack works only for variants of Sarmal up to 384 bits. Note that we can choose the messages in our attack and hence we can even construct meaningful collisions for the hash function.},
+   abstract  = {In this paper, we show a collision attack on the hash function of Sarmal with different salt. The attack has a complexity of $2^{n/3}$ compression function evaluations and memory requirement of $2^{n/3}$. Since the salt of Sarmal is only 256 bits the attack works only for variants of Sarmal up to 384 bits. Note that we can choose the messages in our attack and hence we can even construct meaningful collisions for the hash function.
+}
 </bibtex>

@@ Line 4: / Line 4: @@
 * Website: [http://www.metu.edu.tr/~e127761/sarmal_hash.html http://www.metu.edu.tr/~e127761/sarmal_hash.html]
 * NIST submission package: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/Sarmal.zip Sarmal.zip]
-* Specification:
 <bibtex>
@@ Line 15: / Line 15: @@
+}
 </bibtex>
 == Cryptanalysis ==
 <bibtex>

@@ Line 26: / Line 26: @@
    year      = {2008},
    abstract  = {We present a preimage attack on Sarmal-512 that requires $max(2^{512-s}; 2^{256+s})$ computations and $2^{s}$ memory.},
+}
 </bibtex>

@@ Line 3: / Line 3: @@
 * Author(s): Kerem Varıcı, Onur Özen and Çelebi Kocair
 * Website: [http://www.metu.edu.tr/~e127761/sarmal_hash.html http://www.metu.edu.tr/~e127761/sarmal_hash.html]
 * Specification:

@@ Line 7: / Line 7: @@
 <bibtex>
 @misc{sha3VariciOK08,
-   author    = {Kerem Varıcı and Onur Özen and Çelebi Kocair},
+   author    = {Kerem Var\i c\i \ and Onur \"{O}zen and \c{C}elebi Kocair},
    title     = {Sarmal: SHA-3 Proposal},
    url        = {http://www.metu.edu.tr/~e127761/Supporting_Documentation/SarmaL.pdf},

@@ Line 21: / Line 21: @@
    author    = {Ivica Nikolić},
    title     = {Preimage attack on Sarmal-512},
-   url        = {http://lj.streamclub.ru/papers/hash/sarmal.pdf},
+   url        = {http://ehash.iaik.tugraz.at/uploads/7/77/Sarmal.pdf},
    howpublished = {Available online},
    year      = {2008},
+}
 </bibtex>

← Older revision		Revision as of 14:31, 25 November 2008
Line 17:		Line 17:
	== Cryptanalysis ==		== Cryptanalysis ==

−	* I. Nikolic, Preimage attack on Sarmal-512~~. Details: [~~http://lj.streamclub.ru/papers/hash/sarmal.pdf ~~here]~~	+	<bibtex>
		+	@misc{sarmalN08,
		+	author = {Ivica Nikolić},
		+	title = {Preimage attack on Sarmal-512},
		+	url = {http://lj.streamclub.ru/papers/hash/sarmal.pdf},
		+	howpublished = {Available online},
		+	year = {2008},
		+	}
		+	</bibtex>