High-speed & Low Area Hardware Architectures of the Whirlpool Hash Function

  • Authors:
  • Máire McLoone;Ciaran McIvor

  • Affiliations:
  • Institute of Electronics, Communications and Information Technology (ECIT), Queen's University Belfast, Belfast, UK BT3 9DT;Institute of Electronics, Communications and Information Technology (ECIT), Queen's University Belfast, Belfast, UK BT3 9DT

  • Venue:
  • Journal of VLSI Signal Processing Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

High-speed and low area hardware architectures of the Whirlpool hash function are presented in this paper. A full Look-up Table (LUT) based design is shown to be the fastest method by which to implement the non-linear layer of the algorithm in terms of logic. An unrolled Whirlpool architecture implemented on the Virtex XC4VLX100 device achieves a throughput of 4.9 Gbps. This is faster than a SHA-512 design implemented on the same device and other previously reported hash function architectures. A low area iterative architecture, which utilises 64-bit operations as opposed to full 512-bit operations, is also described. It runs at 430 Mbps and occupies 709 slices on a Virtex X4VLX15. This proves to be one of the smallest 512-bit hash function architectures currently available.