Classification of the SHA-3 Candidates

Fleischmann, Ewan; Forler, Christian; Gorski, Michael

doi:10.4230/DagSemProc.09031.5

Document

Classification of the SHA-3 Candidates

Authors Ewan Fleischmann, Christian Forler, Michael Gorski

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 9031
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2009-03-30

PDF

File

PDF

DagSemProc.09031.5.pdf

Filesize: 154 kB
11 pages

Document Identifiers

DOI: 10.4230/DagSemProc.09031.5
URN: urn:nbn:de:0030-drops-19482

Subject Classification

Keywords

Hash function
SHA-3
classification

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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

Author Details

Ewan Fleischmann

Christian Forler

Michael Gorski

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail