On Optimized FPGA Implementations of the SHA-3 Candidate Groestl

Bernhard Jungk; Steffen Reith; Juergen Apfelbeck

Paper 2009/206

On Optimized FPGA Implementations of the SHA-3 Candidate Groestl

Bernhard Jungk, Steffen Reith, and 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.

Metadata

Available format(s): PDF PS
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Keywords: hash functions Groestl FPGA
Contact author(s): reith @ informatik fh-wiesbaden de
History: 2009-05-26: received
Short URL: https://ia.cr/2009/206
License: CC BY

BibTeX

@misc{cryptoeprint:2009/206,
      author = {Bernhard Jungk and Steffen Reith and Juergen Apfelbeck},
      title = {On Optimized {FPGA} Implementations of the {SHA}-3 Candidate Groestl},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/206},
      year = {2009},
      url = {https://eprint.iacr.org/2009/206}
}