Difference between revisions of "Sarmal"

From The ECRYPT Hash Function Website
m (The algorithm)
(Collisions and Pseudo-Collisions for Sarmal)
Line 26: Line 26:
 
   year      = {2008},
 
   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.},
 
   abstract  = {We present a preimage attack on Sarmal-512 that requires $max(2^{512-s}; 2^{256+s})$ computations and $2^{s}$ memory.},
 +
}
 +
</bibtex>
 +
 +
<bibtex>
 +
@misc{sarmalMS08,
 +
  author    = {Florian Mendel and Martin Schläffer},
 +
  title    = {Collisions and Pseudo-Collisions 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.},
 
}
 
}
 
</bibtex>
 
</bibtex>

Revision as of 11:06, 19 December 2008