Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing

Abstract

In November 2007 NIST announced that it would organize the SHA-3 competition to select a new cryptographic hash function family by 2012. In the selection process, hardware performances of the candidates will play an important role. Our analysis of previously proposed hardware implementations shows that three SHA-3 candidate algorithms can provide superior performance in hardware: Keccak, Luffa and Blue Midnight Wish (BMW). In this paper, we provide efficient and fast hardware implementations of these three algorithms. Considering both single-and multimessage hashing applications with an emphasis on both speed and efficiency, our work presents more comprehensive analysis of their hardware performances by providing different performance figures for different target devices. To our best knowledge, this is the first work that provides a comparative analysis of SHA-3 candidates in multi-message applications. We discover that BMW algorithm can provide much higher throughput than previously reported if used in multi-message hashing. We also show that better utilization of resources can increase speed via different configurations. We implement our designs using Verilog HDL, and map to both ASIC and FPGA devices (Spartan3, Virtex2, and Virtex 4) to give a better comparison with those in the literature. We report total area, maximum frequency, maximum throughput and throughput/area of the designs for all target devices. Given that the selection process for SHA3 is still open; our results will be instrumental to evaluate the hardware performance of the candidates.

Throughput vs. Area Trade-offs in High-Speed Architectures of Five Round 3 SHA-3 Candidates Implemented Using Xilinx and Altera FPGAs

“…In [12], results for 256-bit and 512-bit variants of all algorithms, implemented using 10 FPGA families from Xilinx and Altera are discussed. Additionally, pipelined implementations of three Round 2 SHA-3 candidates have been investigated in [4].…”

TSensors Vision, Infrastructure and Security Challenges in Trillion Sensor Era

“…Tan et al proposed a server-less authentication protocol that also utilizes a known hash function between the reader and the tags, and XOR primitives. All these protocols are light-weight but have some security flaws which can be 10500 [12] 1500 [37] manipulated by the adversaries to attack the system. For instance, the protocol proposed by Henrici et al maintains a session number to synchronize the tag and the reader which can be easily manipulated by a malicious attacker by interrogating the tag in a middle step of the authentication process, and thus desynchronizing the tag and the reader [49].…”

Pushing the Limits of SHA-3 Hardware Implementations to Fit on RFID

“…In view of ASIC designs, there exist many high-speed variants proposed by S. Tillich et al [40], A. Akin et al [1], L. Henzen et al [21], and X. Guo et al [19].…”