Construction of substitution boxes using finite fields

Naveed Ahmed Umrani; Iqrar Ali Pali; Safia Amir Dahri; Muhammad Afzal Soomro; Kamran Nazir Memon

Author(s)

Naveed Ahmed Umrani Department of Mathematics and Statistics, Quaid-e-Awam University of Engineering, Science, and Technology Nawabshah, Pakistan

Iqrar Ali Pali Department of Mathematics and Statistics, Quaid-e-Awam University of Engineering, Science, and Technology Nawabshah, Pakistan

Safia Amir Dahri Department of Telecommunication Engineering, Quaid-e-Awam University of Engineering,Science, and Technology Nawabshah,Pakistan

Muhammad Afzal Soomro Department of Mathematics and Statistics, Quaid-e-Awam University of Engineering, Science, and Technology Nawabshah, Pakistan

Kamran Nazir Memon Department of Mathematics and Statistics, Quaid-e-Awam University of Engineering, Science, and Technology Nawabshah, Pakistan

Abstract

Substitution boxes (S-boxes) play a crucial role in modern cryptographic algorithms, providing non-linear transformations that enhance the security of data encryption. S-boxes are essential components of symmetric key ciphers, such as Advanced Encryption Standard (AES) and Data Encryption Standard (DES). Non-linearity is a fundamental property that resists linear attacks and enhances the cryptographic strength of S-boxes. Constructing secure and efficient S-boxes with high non-linearity is a critical challenge in cryptography. The problem of this research is to develop a systematic approach for constructing substitution boxes (S-boxes) using finite fields, with a particular focus on achieving optimal non-linearity to enhance the security of cryptographic algorithms.

Publication Details

Page(s) 1-15

DOI DOI not available

Published Journal: VFAST Transactions on Mathematics, Volume: 11, Issue: 2, Year: 2023

Request the full text from PASTIC

Keywords

Cryptography, Subject Classification, S-boxes, Field theory, and Cryptographic Algorithms, Finite Fields, Non-linearty, Communication network theory