License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-19554
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1955/
Go to the corresponding Portal


Gauravaram, Praveen ; Knudsen, Lars R. ; Matusiewicz, Krystian ; Mendel, Florian ; Rechberger, Christian ; Schläffer, Martin ; Thomsen, Søren S.

Grøstl - a SHA-3 candidate

pdf-format:
Document 1.pdf (241 KB)


Abstract

Grøstl is a SHA-3 candidate proposal. Grøstl is an iterated hash function with a compression function built from two fixed, large, distinct permutations. The design of Grøstl is transparent and based on principles very different from those used in the SHA-family. The two permutations are constructed using the wide trail design strategy, which makes it possible to give strong statements about the resistance of Grøstl against large classes of cryptanalytic attacks. Moreover, if these permutations are assumed to be ideal, there is a proof for the security of the hash function. Grøstl is a byte-oriented SP-network which borrows components from the AES. The S-box used is identical to the one used in the block cipher AES and the diffusion layers are constructed in a similar manner to those of the AES. As a consequence there is a very strong confusion and diffusion in Grøstl. Grøstl is a so-called wide-pipe construction where the size of the internal state is significantly larger than the size of the output. This has the effect that all known, generic attacks on the hash function are made much more difficult. Grøstl has good performance on a wide range of platforms and counter-measures against side-channel attacks are well-understood from similar work on the AES.

BibTeX - Entry

@InProceedings{gauravaram_et_al:DSP:2009:1955,
  author =	{Praveen Gauravaram and Lars R. Knudsen and Krystian Matusiewicz and Florian Mendel and Christian Rechberger and Martin Schl{\"a}ffer and Thomsen S{\o}ren S.},
  title =	{Gr{\o}stl - a SHA-3 candidate},
  booktitle =	{Symmetric Cryptography },
  year =	{2009},
  editor =	{Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
  number =	{09031},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1955},
  annote =	{Keywords: SHA-3 proposal, hash function}
}

Keywords: SHA-3 proposal, hash function
Seminar: 09031 - Symmetric Cryptography
Issue Date: 2009
Date of publication: 30.03.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI