Improving PRESENT Lightweight Algorithm

Author

Aldabbagh, Sufyan Salim Mahmood ; Al Shaikhli, Imad Fakhri Taha

Author_Institution

Dept. of Inf. Syst., IIUM, Kuala Lumpur, Malaysia

fYear

2013

fDate

23-24 Dec. 2013

Firstpage

254

Lastpage

258

Abstract

Lightweight block cipher algorithms are vital for constrained environment. Substitution box (S-box) is the essential constituent of many lightweight block cipher algorithms and it is the only nonlinear part. It is proficient to create confusion in the plaintext during the process of encryption. In this research, a new way of key dependent S-box is proposed by choosing one S-box out of 16 good S-boxes. Preliminary analysis of linear and differential cryptanalysis is showing that the proposed algorithm is more secure than fixed PRESENT S-box. Also, the complexity of the PRESENT S - box in each round is 28 while the complexity of the proposed algorithm S-box is 212 in each round.

Keywords

cryptography; PRESENT S-box; PRESENT lightweight algorithm; differential cryptanalysis; encryption process; key dependent S-box; lightweight block cipher algorithm; linear cryptanalysis; substitution box; Algorithm design and analysis; Approximation algorithms; Ciphers; Complexity theory; Resistance; Key Dependent S-box; PRESENT lightweight block cipher; S-box; linear cryptanalysis and differential cryptanalysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Computer Science Applications and Technologies (ACSAT), 2013 International Conference on

Conference_Location

Kuching

Type

conf

DOI

10.1109/ACSAT.2013.57

Filename

6836586