Sarmal

From The ECRYPT Hash Function Website

Jump to: navigation, search

1 The algorithm


Kerem Var\i c\i \, Onur \"Ozen, \cCelebi Kocair - Sarmal: SHA-3 Proposal
Submission to NIST, 2008
[Electronic Edition] [Bibtex]
Author : Kerem Var\i c\i \, Onur \"Ozen, \cCelebi Kocair
Title : Sarmal: SHA-3 Proposal
In : Submission to NIST -


2 Cryptanalysis

Type of Analysis Hash Function Part Hash Size (n) Parameters/Variants Compression Function Calls Memory Requirements Reference
preimage hash 512 max(2512-s,2256+s) 2s Nikolić
collision with salt hash 224,256,384 2n/3 2n/3 Mendel,Schläffer
preimage with salt hash 224,256 2n/2+x 2n/2-x Mendel,Schläffer
preimage with salt hash 384,512 2n-128+x 2128-x Mendel,Schläffer
non-randomness compression function all 2 - Mouha,Bjørstad,Preneel

A description of this table is given here.


Ivica Nikolić - Preimage attack on Sarmal-512
Available online, 2008
[Electronic Edition] [Bibtex]
Author : Ivica Nikolić
Title : Preimage attack on Sarmal-512
In : Available online -
[Abstract]

Florian Mendel, Martin Schläffer - Collisions and Preimages for Sarmal
Available online, 2008
[Electronic Edition] [Bibtex]
Author : Florian Mendel, Martin Schläffer
Title : Collisions and Preimages for Sarmal
In : Available online -
[Abstract]

Nicky Mouha, Tor E. Bjørstad, Bart Preneel - Non-randomness in the Sarmal compression function
Available online, 2009
[Electronic Edition] [Bibtex]
Author : Nicky Mouha, Tor E. Bjørstad, Bart Preneel
Title : Non-randomness in the Sarmal compression function
In : Available online -
[Abstract]
Personal tools