ABSTRACT
Substitution boxes (S-boxes) are of major importance in cryptography as they are used to provide the property of confusion to the corresponding cryptosystem. Thus, a great amount of research is devoted to their study. In this contribution, a new methodology for designing strong S-boxes is studied and two Evolutionary Computation methods, the Particle Swarm Optimization and the Differential Evolution algorithm are employed to tackle the problem at hand.
