A Lightweight Implementation of Keccak Hash Function for Radio-Frequency Identification Applications

Date

2010-06-09

Author

Kavun, Elif Bilge
Yalcin, Tolga

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

4
views

0
downloads

In this paper, we present a lightweight implementation of the permutation Keccak-f[200] and Keccak-f[400] of the SHA-3 candidate hash function Keccak. Our design is well suited for radio-frequency identification (RFID) applications that have limited resources and demand lightweight cryptographic hardware. Besides its low-area and low-power, our design gives a decent throughput. To the best of our knowledge, it is also the first lightweight implementation of a sponge function, which differentiates it from the previous works. By implementing the new hash algorithm Keccak, we have utilized unique advantages of the sponge construction. Although the implementation is targeted for Application Specific Integrated Circuit (ASIC) platforms, it is also suitable for Field Programmable Gate Arrays (FPGA). To obtain a compact design, serialized data processing principles are exploited together with algorithm-specific optimizations. The design requires only 2.52K gates with a throughput of 8 Kbps at 100 KHz system clock based on 0.13-mu m CMOS standard cell library.

Subject Keywords

RFID, High throughput, Low-power, Low-area, Serialized processing, Sponge function, SHA-3, Keccak

URI

https://hdl.handle.net/11511/64565

Collections

Graduate School of Applied Mathematics, Conference / Seminar