Efficient FPGA Implementation of Secure Hash Algorithm Grøstl – SHA-3 Finalist

Cryptographic hash functions are used for digital signatures; message authentication codes (MACs) and other forms of authentication. National Institute of Standards and Technology (NIST) announced a publicly open competition for selection of new standard Secure Hash Algorithm called SHA-3. Hardware performance evaluation of the candidates of this competition is a vital part of this contest. In this work we present an efficient FPGA implementation of Grostl, one of the final round candidates of SHA-3. We show our results in the form of chip area consumption, throughput and throughput per area. We compare and contrast these results with other reported implementations of Grostl. Our design ranks highest in terms of throughput per area, achieving figures of 5.47 Mbps/slice on Virtex 7 and 5.12 Mbps/slice for Grostl-256 on Virtex 6.

[1]  Marc Stevens,et al.  Fast Collision Attack on MD5 , 2006, IACR Cryptol. ePrint Arch..

[2]  Dengguo Feng,et al.  Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD , 2004, IACR Cryptol. ePrint Arch..

[3]  William P. Marnane,et al.  FPGA Implementations of the Round Two SHA-3 Candidates , 2010, 2010 International Conference on Field Programmable Logic and Applications.

[4]  Vincent Rijmen,et al.  The Design of Rijndael: AES - The Advanced Encryption Standard , 2002 .

[5]  Steffen Reith,et al.  On FPGA-Based Implementations of the SHA-3 Candidate Grøstl , 2010, 2010 International Conference on Reconfigurable Computing and FPGAs.