Please use this identifier to cite or link to this item: http://dspace.uniten.edu.my/jspui/handle/123456789/6636
Title: Implementation of lightweight cryptographic primitives
Authors: Hammad, B.T. 
Jamil, N. 
Rusli, M.E. 
Z’Aba, M.R. 
Ahmed, I.T. 
Issue Date: 2017
Abstract: Lightweight cryptography is not a new branch in cryptography. It is a subject specifically addressing the implementation of security mechanism in pervasive computing that are characterized by smart but resource constrained devices. There are at least two main lightweight symmetric cryptographic primitives namely lightweight block cipher and lightweight hash algorithm. Most of the previous surveys were focusing on implementation of specific cryptographic primitives. In this paper we present a comprehensive survey of all lightweight symmetric cryptographic primitives, from hardware and software perspectives. The survey covers analysis of these algorithms and a comparison between these primitives in terms of throughput, number of cycle, comprehensive area, power, and energy. We also provide a classification of the structure of lightweight block cipher and lightweight hash function. These classifications are very useful because the primitives have different and sometimes contrary characteristics. Finally this comprehensive survey highlights some of the issues related to security aspect of small key length in lightweight cryptographic primitives. © 2005 – ongoing JATIT & LLS.
URI: http://dspace.uniten.edu.my/jspui/handle/123456789/6636
Appears in Collections:CSIT Scholarly Publication

Show full item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.