[Resource Topic] 2009/206: On Optimized FPGA Implementations of the SHA-3 Candidate Groestl

Welcome to the resource topic for 2009/206

Title:
On Optimized FPGA Implementations of the SHA-3 Candidate Groestl

Authors: 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.

ePrint: https://eprint.iacr.org/2009/206

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .