Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Fleischmann, Ewan; Forler, Christian; Gorski, Michael License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-19482

; ;

Classification of the SHA-3 Candidates



In this note we give an overview on the current state of the SHA-3 candidates. First, we classify all publicly known candidates and, second, we outline and summarize the performance data as given in the candidates documentation for $64$-bit and $32$-bit implementations. We define performance classes and classify the hash algorithms. Note, that this article will be updated as soon as new candidates arrive or new cryptanalytic results get published. Comments to the authors of this article are welcome.

BibTeX - Entry

  author =	{Ewan Fleischmann and Christian Forler and Michael Gorski},
  title =	{Classification of the SHA-3 Candidates},
  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 =		{},
  annote =	{Keywords: Hash function, SHA-3, classification}

Keywords: Hash function, SHA-3, classification
Seminar: 09031 - Symmetric Cryptography
Issue date: 2009
Date of publication: 2009

DROPS-Home | Fulltext Search | Imprint Published by LZI