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