Generating dynamic S-BOX based on Particle Swarm Optimization and Chaos Theory for AES

Abstract

Data security is a significant requirement in our time. As a result of the rapid development of unsecured computer networks, the personal data should be protected from unauthorized persons and as a result of exposure AES algorithm is subjected to theoretical attacks such as linear attacks, differential attacks, and practical attacks such as brute force attack these types of attacks are mainly directed at the S-BOX and since the S-BOX table in the algorithm is static and no dynamic so this is a major weakness for the S-BOX table, the algorithm should be improved to be impervious to future dialects that attempt to analyse and break the algorithm in order to remove these weakness points, Will be generated dynamic substitution box (S-BOX) base on the input key, shifting, chaotic theory (1D, 2D logistic map), and particle swarm algorithm. At the same time will be generated inverse of the table S-BOX through output of the S-BOX which will be generated from the suggestions above will return the values of the union of the row and the column for all the values generated for S-BOX. The S-BOX output is tested in several measurements represent (complexity, time, avalanche criterion, and balance) and the results show that any change in the input will change the output S-BOX also the proposed algorithm will be measured by the five statistical and NIST measurements all results will show a successful exception random excursions, random excursions variant (test not application ). The time needed to implement it requires only milliseconds and is approximated to the time taken for the original algorithm.