Cryptology ePrint Archive: Report 2009/206

On Optimized FPGA Implementations of the SHA-3 Candidate Groestl

Bernhard Jungk, Steffen Reith, Juergen Apfelbeck

Abstract: The National Institute of Standards and Technology (NIST) has started a competition for a new secure hash standard. In this context third party implementations of all proposed hash functions are regarded as an important part of the competition. We chose to implement the Groestl hash function for FPGAs, for its resemblance to AES. More precisely we developed two optimized versions, one optimized for throughput, the other one for area. Both implementations improve the results and estimates presented in the original submission to the competition. The performance of both implementations may be improved further, thus Groestl seems to be a good candidate for implementations on medium sized FPGAs. Besides that, it is shown that Groestl needs a significant amount of resources, which will hinder its use for automotive applications.

Category / Keywords: implementation / hash functions, Groestl, FPGA

Date: received 12 May 2009, last revised 16 May 2009

Contact author: reith at informatik fh-wiesbaden de

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20090526:032809 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]