Hardware Implementation of the Compression Function for Selected SHA-3 Candidates

Hardware implementation of the main building block (compression function) for five different SHA-3 candidates is presented. The five candidates, namely Blue Midnight Wish, Luffa, Skein, Shabal, and Blake have been considered since they present faster software implementation results compared to the rest of the SHA-3 proposals. The compression functions realized in hardware create the message digest of size 256 bits. We report both ASIC and FPGA implementations. The results allow an easy comparison for hardware performance of the candidates.

[1]  Mohamed El-Hadedy,et al.  Cryptographic hash function Blue Midnight Wish , 2009, 2009 Proceedings of the 1st International Workshop on Security and Communication Networks.

[2]  C. Cannière Hash Function Luffa Supporting Document , 2008 .

[3]  Christian Forler,et al.  Classification of the SHA-3 Candidates , 2008, IACR Cryptol. ePrint Arch..

[4]  Stefan Lucks,et al.  The Skein Hash Function Family , 2009 .

[5]  Antoine Joux,et al.  Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions , 2004, CRYPTO.

[6]  Willi Meier,et al.  The Hash Function Family LAKE , 2008, FSE.

[7]  Eli Biham,et al.  A Framework for Iterative Hash Functions - HAIFA , 2007, IACR Cryptol. ePrint Arch..

[8]  David A. Wagner,et al.  Tweakable Block Ciphers , 2002, Journal of Cryptology.

[9]  Stefan Lucks,et al.  A Failure-Friendly Design Principle for Hash Functions , 2005, ASIACRYPT.