Cryptology ePrint Archive: Report 2009/349

Compact Hardware Implementations of the SHA-3 Candidates ARIRANG, BLAKE, Grøstl, and Skein

Stefan Tillich and Martin Feldhofer and Wolfgang Issovits and Thomas Kern and Hermann Kureck and Michael Mühlberghuber and Georg Neubauer and Andreas Reiter and Armin Köfler and Mathias Mayrhofer

Abstract: The weakening of the widely used SHA-1 hash function has also cast doubts on the strength of the related algorithms of the SHA-2 family. The US NIST has therefore initiated the SHA-3 competition in order to select a modern hash function algorithm as a ``backup'' for SHA-2. This algorithm should be efficiently implementable both in software and hardware under different constraints. In this paper, we present hardware implementations of the four SHA-3 candidates ARIRANG, BLAKE, Grøstl, and Skein with the primary constraint of minimizing chip area.

Category / Keywords: implementation / SHA-3, hash functions, implementation, hardware, low-area

Date: received 14 Jul 2009

Contact author: Stefan Tillich at iaik tugraz at

Available format(s): PDF | BibTeX Citation

Version: 20090718:044612 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]