We propose a genetic algorithm (GA) to search for plateaued boolean functions, which represent suitable candidates for the design of stream ciphers due to their good cryptographic properties. Using the spectral inversion technique introduced by Clark, Jacob, Maitra and Stanica, our GA encodes the chromosome of a candidate solution as a permutation of a three-valued Walsh spectrum. Additionally, we design specialized crossover and mutation operators so that the swapped positions in the offspring chromosomes correspond to different values in the resulting Walsh spectra. Some tests performed on the set of pseudoboolean functions of n = 6 and n = 7 variables show that in the former case our GA outperforms Clark et al.’s simulated annealing algorithm with respect to the ratio of generated plateaued boolean functions per number of optimization runs.

Mariot, L., Leporati, A. (2015). A genetic algorithm for evolving plateaued cryptographic boolean functions. In Theory and Practice of Natural Computing 2015 Fourth International Conference, TPNC 2015, Mieres, Spain, December 15-16 proceedings (pp.33-45). Springer Verlag [10.1007/978-3-319-26841-5_3].

A genetic algorithm for evolving plateaued cryptographic boolean functions

MARIOT, LUCA
;
LEPORATI, ALBERTO OTTAVIO
Ultimo
2015

Abstract

We propose a genetic algorithm (GA) to search for plateaued boolean functions, which represent suitable candidates for the design of stream ciphers due to their good cryptographic properties. Using the spectral inversion technique introduced by Clark, Jacob, Maitra and Stanica, our GA encodes the chromosome of a candidate solution as a permutation of a three-valued Walsh spectrum. Additionally, we design specialized crossover and mutation operators so that the swapped positions in the offspring chromosomes correspond to different values in the resulting Walsh spectra. Some tests performed on the set of pseudoboolean functions of n = 6 and n = 7 variables show that in the former case our GA outperforms Clark et al.’s simulated annealing algorithm with respect to the ratio of generated plateaued boolean functions per number of optimization runs.
paper
Boolean functions; Cryptography; Evolutionary computing; Genetic algorithms; Nonlinearity; Resiliency; Simulated annealing; Spectral inversion; Walsh transform; Computer Science (all); Theoretical Computer Science
English
International Conference on Theory and Practice of Natural Computing, TPNC - December 15-16
2015
Theory and Practice of Natural Computing 2015 Fourth International Conference, TPNC 2015, Mieres, Spain, December 15-16 proceedings
9783319268408
2015
9477
33
45
none
Mariot, L., Leporati, A. (2015). A genetic algorithm for evolving plateaued cryptographic boolean functions. In Theory and Practice of Natural Computing 2015 Fourth International Conference, TPNC 2015, Mieres, Spain, December 15-16 proceedings (pp.33-45). Springer Verlag [10.1007/978-3-319-26841-5_3].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/103096
Citazioni
  • Scopus 27
  • ???jsp.display-item.citation.isi??? ND
Social impact