Lightweight implementations of SHA-3 candidates on FPGAs

  • Authors:
  • Jens-Peter Kaps;Panasayya Yalla;Kishore Kumar Surapathi;Bilal Habib;Susheel Vadlamudi;Smriti Gurung;John Pham

  • Affiliations:
  • ECE Department, George Mason University, Fairfax, VA;ECE Department, George Mason University, Fairfax, VA;ECE Department, George Mason University, Fairfax, VA;ECE Department, George Mason University, Fairfax, VA;ECE Department, George Mason University, Fairfax, VA;ECE Department, George Mason University, Fairfax, VA;ECE Department, George Mason University, Fairfax, VA

  • Venue:
  • INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The NIST competition for developing the new cryptographic hash algorithm SHA-3 has entered its third round. One evaluation criterion is the ability of the candidate algorithm to be implemented on resource-constrained platforms. This includes FPGAs for embedded and hand-held devices. However, there has not been a comprehensive set of lightweight implementations for FPGAs reported to date. We hope to fill this gap with this paper in which we present lightweight implementations of all SHA-3 finalists and all round-2 candidates with the exception of SIMD. All implementations were designed to achieve maximum throughput while adhering to an area constraint of 400-600 slices and one Block RAM on Xilinx Spartan-3 devices. We also synthesized them for Virtex-V, Altera Cyclone-II, and the new Xilinx Spartan-6 devices.