New Key-Dependent S-Box Generation Algorithm on AES

Abstract

Aims: Cryptography means 'hidden secrets'. The primary purpose of cryptography is to protect networks and data over a wireless communication channel. The cryptographic approach secures the data of a network from any internal or external attacks. Background: There are several kinds of cryptographic techniques, such as Data Encryption Standard (DES), RSA (Rivest- Shamir- Adleman), Advanced Encryption Standard (AES), Blowfish, Twofish, etc. Out of these algorithms, AES shows wide acceptance for its superiority in providing confidentiality to secret information. Another cause for extensive acceptance is that AES is simple, convenient to implement, has a low charge, and higher security. Several changes have been proposed to modify AES by cryptographers and researchers all around the world. Objective: This research paper offers a new key-dependent s-box generation algorithm for AES. Methods: A list of irreducible polynomials of degree 8 is used to generate the s-box depending on the secret key to provide more invulnerable ciphertext in comparison to standard AES. This design of this proposed model is easy and convenient to implement than different dynamic s-box technology algorithms. Results : The metrics chosen for overall performance evaluation are Frequency Distribution, Chi-square Test, Avalanche Effect, and Strict Avalanche Criterion. Conclusion: The proposed algorithm satisfies the desired property of these metrics and provides better security in contrast to standard AES.