License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09031.7
URN: urn:nbn:de:0030-drops-19554
URL: http://dagstuhl.sunsite.rwth-aachen.de/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
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:DagSemProc.09031.7,
author = {Gauravaram, Praveen and Knudsen, Lars R. and Matusiewicz, Krystian and Mendel, Florian and Rechberger, Christian and Schl\"{a}ffer, Martin and Thomsen, S{\o}ren S.},
title = {{Gr{\o}stl - a SHA-3 candidate}},
booktitle = {Symmetric Cryptography},
pages = {1--33},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9031},
editor = {Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2009/1955},
URN = {urn:nbn:de:0030-drops-19554},
doi = {10.4230/DagSemProc.09031.7},
annote = {Keywords: SHA-3 proposal, hash function}
}
|
Keywords: |
|
SHA-3 proposal, hash function |
|
Collection: |
|
09031 - Symmetric Cryptography |
|
Issue Date: |
|
2009 |
|
Date of publication: |
|
30.03.2009 |
