Improved Rebound Attack on the Finalist Grøstl

@inproceedings{Jean2012ImprovedRA,
  title={Improved Rebound Attack on the Finalist Gr\ostl},
  author={J{\'e}r{\'e}my Jean and Mar{\'i}a Naya-Plasencia and Thomas Peyrin},
  booktitle={FSE},
  year={2012}
}
Grøstl is one of the five finalist hash functions of the SHA-3 competition. For entering this final phase, the designers have tweaked the submitted versions. This tweak renders inapplicable the best known distinguishers on the compression function presented by Peyrin [18] that exploited the internal permutation properties. Since the beginning of the final round, very few analysis have been published on Grøstl. Currently, the best known rebound-based results on the permutation and the… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS