Classification of the SHA-3 Candidates

Authors Ewan Fleischmann, Christian Forler, Michael Gorski



PDF
Thumbnail PDF

File

DagSemProc.09031.5.pdf
  • Filesize: 154 kB
  • 11 pages

Document Identifiers

Author Details

Ewan Fleischmann
Christian Forler
Michael Gorski

Cite AsGet BibTex

Ewan Fleischmann, Christian Forler, and Michael Gorski. Classification of the SHA-3 Candidates. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 9031, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09031.5

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.
Keywords
  • Hash function
  • SHA-3
  • classification

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail