ScholarLens Back to search
2013•Unpublished venueRequires access

Improving PRESENT Lightweight Algorithm

Sufyan Salim Mahmood Aldabbagh, Imad Fakhri Taha Alshaikhli

Open publisher page 15 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: S-box, Block cipher, Computer science, Plaintext, Differential cryptanalysis, Encryption, Algorithm, Linear cryptanalysis

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improving PRESENT Lightweight Algorithm — Research Paper | ScholarLens