Improving PRESENT Lightweight Algorithm
Sufyan Salim Mahmood Aldabbagh, Imad Fakhri Taha Alshaikhli · 2013
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.