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

174
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

Conference Name

6th Workshop on Radio Frequency Identification Security

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

A Pipelined Camellia Architecture for Compact Hardware Implementation Kavun, Elif Bilge; Yalcin, Tolga (2010-07-09) In this paper, we present a compact and fast pipelined implementation of the block cipher Camellia for 128-bit data and 128-bit key lengths. The implementation is suitable for both Field Programmable Gate Array (FPGA) and Application Specific Integrated Circuit (ASIC) platforms, and is targeted for low area and low power applications. To obtain a compact design, pipelining principles are exploited and platform specific optimizations are made. The design requires only 321 slices with a throughput of 32.96 Mb...
A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations Yazıcı, Adnan (1996-09-11) In this paper we first introduce a new definition for the conformance of tuples existing in a fuzzy database relation. Then we give the formal definitions of fuzzy functional and multivalued dependencies on the basis of the conformance values presented here. Secondly, we list the inference rules after showing that both fuzzy functional and multivalued dependencies are consistent, that is, they reduce to those of the classic functional and multivalued dependencies when crisp attributes are involved. Finally,...
A method for concurrency control in distributed DBMSs: Permission Test Method Halıcı, Uğur (Association for Computing Machinery (ACM), 1987-01-09) In this paper, a method for concurrency control in distributed DBMSs, called Permission Test Method is proposed. The PT method satisfies the basic requirements for concurrency control, that is, it executes the transactions in a serializable order, deadlocks do not appear and indefinite postponment is prevented by the method. In PT method, transactions, which are permitted to run, are not aborted unless a related site failure occurs. Furthermore, the complexity analysis indicates that the algorithm will work...
A modified algorithm for peer-to-peer security Akleylek, Sedat; Emmungil, Levent; NURİYEV, URFAT (2007-01-01) In this paper we present the steganographic approach to peer-to-peer systems with a modified algorithm. This gives the user a very high level of protection against being compelled to disclose its contents. Even the realization of the quantum computer cannot solve NP-hard problem in a polynomial time, a modified algorithm with steganographic use depending on Knapsack problem may make peer-to-peer systems secure.
A Trie-structured Bayesian Model for Unsupervised Morphological Segmentation Kurfalı, Murathan; Ustun, Ahmet; CAN BUĞLALILAR, BURCU (2017-04-23) In this paper, we introduce a trie-structured Bayesian model for unsupervised morphological segmentation. We adopt prior information from different sources in the model. We use neural word embeddings to discover words that are morphologically derived from each other and thereby that are semantically similar. We use letter successor variety counts obtained from tries that are built by neural word embeddings. Our results show that using different information sources such as neural word embeddings and letter s...

Citation Formats

E. B. Kavun and T. Yalcin, “A Lightweight Implementation of Keccak Hash Function for Radio-Frequency Identification Applications,” Istanbul, TURKEY, 2010, vol. 6370, p. 258, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64565.