Proposal new S-box for AES algorithm depend on A. I bee colony

Abstract EN

The AES algorithm, also called the Rijndael algorithm, is a symmetric block cipher, where the data are encrypted/ decrypted in blocks of 128 bits.

Each data block is modified by several rounds of processing, where each round involves four steps.

Three different key sizes are allowed: 128 bits, 192 bits, or 256 bits, and the corresponding number of rounds for each is 10 rounds, 12 rounds, or 14 rounds, respectively.

From the original key, a different “round key” is computed for each of these rounds.

The single nonlinear step is the Sub Bytes step, where each byte of the input is replaced by the result of applying the “S-box” function to that byte.

This nonlinear function involves finding the inverse of the 8-bit number, considered as an element of the Galois field GF (216).

The Galois inverse is not a simple calculation, and so many current implementations use a table of the S-box function output.

This table look-up method is fast and easy to implement.

S-box is influenced by linear and differential cryptanalysis and also interpolation attacks.

In this paper intended a new approach for the design of sbox based on the bee colony algorithm to increase the power of s-box and enhanced resistance against attacks through the use of artificial intelligence algorithms.