Efficient FPGA implementation of secure hash algorithm Grøstl-SHA-3 finalist

M. Muzaffar Rao, Kashif Latif, Arshad Aziz, Athar Mahboob

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 Grøstl, 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 Grøstl. 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 Grøstl-256 on Virtex 6.

Original languageEnglish
Title of host publicationEmerging Trends and Applications in Information Communication Technologies - Second International Multi Topic Conference, IMTIC 2012, Proceedings
Pages361-372
Number of pages12
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2nd International Multi Topic Conference, IMTIC 2012 - Jamshoro, Pakistan
Duration: 28 Mar 201230 Mar 2012

Publication series

NameCommunications in Computer and Information Science
Volume281 CCIS
ISSN (Print)1865-0929

Conference

Conference2nd International Multi Topic Conference, IMTIC 2012
Country/TerritoryPakistan
CityJamshoro
Period28/03/1230/03/12

Keywords

  • FPGA
  • Grøstl
  • Hash Functions
  • High Speed Hardware
  • SHA-3

Fingerprint

Dive into the research topics of 'Efficient FPGA implementation of secure hash algorithm Grøstl-SHA-3 finalist'. Together they form a unique fingerprint.

Cite this