TY - JOUR
ID - 173646
TI - Proposal Framework to Light Weight Cryptography Primitives
JO - Engineering and Technology Journal
JA - ETJ
LA - en
SN - 1681-6900
AU - Abd Zaid, Mustafa M.
AU - Hassan, Soukaena
AD - Computer Sciences Dept., University of Technology-Iraq, Alsina’a street, 10066 Baghdad, Iraq.
Y1 - 2022
PY - 2022
VL - 40
IS - 4
SP - 516
EP - 526
KW - Lightweight
KW - Cryptography
KW - LWAES-128
KW - LWRC4
KW - LWRSA
KW - LWSHA-256
KW - NIST
DO - 10.30684/etj.v40i4.1679
N2 - Due to manufacturing cost and portability limitations, the computing power, storage capacity, and energy of the Internet of Things (IoT) hardware are still slowly developing. From above, the proposed security system based on encryption must consider the resources, time, memory used, and the lifespan of related sensors. In addition, some applications need simple encryption, especially after the emergence of IoT and the Web of Things (WoT). Providing solutions suitable for resource-constrained devices can be achieved by using lightweight cryptography. In this paper, building a framework that includes proposals for producing lightweight security algorithms for cryptography primitives was highly recommended. For the block cipher, some suggestions have been applied to an example of block encryption, Advance Encryption Standard 128 (AES-128), to produce lightweight AES-128. For lightweight stream cipher, the system applied the proposals on Ronald Rivest Cryptography algorithms (RC4). Rivest–Shamir–Adleman (RSA) algorithm is used to produce a lightweight asymmetric cipher by key partition and using the Chinese Remainder Theorem (CRT) in the decryption process to produce a lightweight RSA algorithm. Several proposals have been used for hash functions, the most important of which is reducing the number of rounds and simplifying the functions in SHA-256. Depending on the proposed framework, all the produced lightweight algorithms passed the National Institute of Standards and Technology (NIST) statistical tests for test randomness. The produced algorithms showed better processing time than standard algorithms, less memory usage for a lightweight version of each standard algorithm, and higher throughput than standard algorithms.
UR - https://etj.uotechnology.edu.iq/article_173646.html
L1 - https://etj.uotechnology.edu.iq/article_173646_8bae0973ee8ecf19ff56257299cc0aa5.pdf
ER -