• DocumentCode
    3317239
  • Title

    Utilizing Evolutionary Computation Methods for the Design of S-Boxes

  • Author

    Laskari, Elena C. ; Meletiou, Gerasimos C. ; Vrahatis, Michael N.

  • Author_Institution
    Dept. of Math., Patras Univ.
  • Volume
    2
  • fYear
    2006
  • fDate
    3-6 Nov. 2006
  • Firstpage
    1299
  • Lastpage
    1302
  • 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
  • Keywords
    cryptography; evolutionary computation; particle swarm optimisation; S-box design; ciphers; differential evolution; evolutionary computation; particle swarm optimization; substitution boxes; Algorithm design and analysis; Ant colony optimization; Autocorrelation; Boolean functions; Computational intelligence; Cryptography; Design methodology; Evolutionary computation; Genetic algorithms; Particle swarm optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Security, 2006 International Conference on
  • Conference_Location
    Guangzhou
  • Print_ISBN
    1-4244-0605-6
  • Electronic_ISBN
    1-4244-0605-6
  • Type

    conf

  • DOI
    10.1109/ICCIAS.2006.295267
  • Filename
    4076173