FPGA implementations of SHA-3 candidates: CubeHash, Grøstl, Lane, Shabal and Spectral Hash

  • Brian Baldwin
  • , Andrew Byrne
  • , Mark Hamilton
  • , Neil Hanley
  • , Robert P. McEvoy
  • , Weibo Pan
  • , William P. Marnane

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

Hash functions are widely used in, and form an important part of many cryptographic protocols. Currently, a public competition is underway to find a new hash algorithm(s) for inclusion in the NIST Secure Hash Standard (SHA-3). Computational efficiency of the algorithms in hardware will form one of the evaluation criteria. In this paper, we focus on five of these candidate algorithms, namely CubeHash, Grøstl, LANE, Shabal and Spectral Hash. Using Xilinx Spartan-3 and Virtex-5 FPGAs, we present architectures for each of these hash functions, and explore area-speed trade-offs in each design. The efficiency of various architectures for the five hash functions is compared in terms of throughput per unit area. To the best of the authors' knowledge, this is the first such comparison of these SHA-3 candidates in the literature.

Original languageEnglish
Title of host publication12th Euromicro Conference on Digital System Design
Subtitle of host publicationArchitectures, Methods and Tools, DSD 2009
Pages783-790
Number of pages8
DOIs
Publication statusPublished - 2009
Event12th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2009 - Patras, Greece
Duration: 27 Aug 200929 Aug 2009

Publication series

Name12th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2009

Conference

Conference12th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2009
Country/TerritoryGreece
CityPatras
Period27/08/0929/08/09

Fingerprint

Dive into the research topics of 'FPGA implementations of SHA-3 candidates: CubeHash, Grøstl, Lane, Shabal and Spectral Hash'. Together they form a unique fingerprint.

Cite this