Utilizing Evolutionary Computation Methods for the Design of S-Boxes
E.C. Laskari, Gerasimos C. Meletiou, Michael N. Vrahatis
Abstract
E.C. Laskari, Gerasimos C. Meletiou, Michael N. Vrahatis
Abstract
Among the most important components of many contemporary ciphers are the substitution boxes (S-boxes) and a great amount of research is devoted to their study. In this paper, a new methodology for designing strong S-boxes is proposed and two evolutionary computation methods, the particle swarm optimization and the differential evolution algorithm are employed to tackle the problem at hand. The obtained results are promising and indicate that this novel approach is effective
OpenAlex reports 28 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Among the most important components of many contemporary ciphers are the substitution boxes (S-boxes) and a great amount of research is devoted to their study. In this paper, a new methodology for designing strong S-boxes is proposed and two evolutionary computation methods, the particle swarm optimization and the differential evolution algorithm are employed to tackle the problem at hand. The obtained results are promising and indicate that this novel approach is effective
Key concepts: Evolutionary computation, Differential evolution, Computer science, Particle swarm optimization, Computation, Evolutionary algorithm, Interactive evolutionary computation, S-box