Classification of the SHA-3 Candidates

Ewan Fleischmann; Christian Forler; Michael Gorski

Paper 2008/511 Original: eprint.iacr.org/2008/511 ↗

Classification of the SHA-3 Candidates

Ewan Fleischmann

Christian Forler

Michael Gorski

Abstract

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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
History: 2009-04-19: last updated; 2008-12-09: published
Short URL: https://ia.cr/2008/511
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2008/511,
      author = {Ewan Fleischmann and Christian Forler and Michael Gorski},
      title = {Classification of the SHA-3 Candidates},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/511},
      year = {2008},
      url = {https://eprint.iacr.org/2008/511}
}