
Research Article
An S-box Design Using Irreducible Polynomial with Affine Transformation for Lightweight Cipher
@INPROCEEDINGS{10.1007/978-3-030-91424-0_13, author={Muhammad Rana and Quazi Mamun and Rafiqul Islam}, title={An S-box Design Using Irreducible Polynomial with Affine Transformation for Lightweight Cipher}, proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Systems. 17th EAI International Conference, QShine 2021, Virtual Event, November 29--30, 2021, Proceedings}, proceedings_a={QSHINE}, year={2021}, month={11}, keywords={Block cipher Cryptanalysis Internet of Things (IoT) Irreducible polynomial S-box}, doi={10.1007/978-3-030-91424-0_13} }
- Muhammad Rana
Quazi Mamun
Rafiqul Islam
Year: 2021
An S-box Design Using Irreducible Polynomial with Affine Transformation for Lightweight Cipher
QSHINE
Springer
DOI: 10.1007/978-3-030-91424-0_13
Abstract
Traditional cryptographic block cipher algorithms are often unsuitable for low-resource profiled IoT (Internet of Things) devices. A lightweight cryptographic algorithm is thus mandated. The S boxes are often called the heart of a cryptographic protocol, as a considerable amount of resource and time complexities are associated with the design of an S box. A lightweight S box will consume less memory, less power and less time, ensuring a high-level Shanon’s property of confusion. This paper proposes a lightweight S box design to meet all the requirements of lightweight cryptographic ciphers. The proposed method applies a couple of transformations- the multiplicative inverse in the Galois field(({2}^{4}))and affine transformations on selected irreducible polynomials to create(4\times 4)S-boxes. Several cryptanalyses such as balance test, bijection property, difference distribution table test, and Boomerang Connectivity were performed to demonstrate the robust characteristics of the proposed method.