A Genetic Algorithm for Evolving Plateaued Cryptographic Boolean Functions

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.
Type de document :
Communication dans un congrès
Theory and Practice of Natural Computing, Dec 2015, Mieres, Spain. 9477, pp.33-45, 2015, Lecture Notes in Computer Science. 〈10.1007/978-3-319-26841-5_3〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01313909
Contributeur : Luca Mariot <>
Soumis le : mardi 10 mai 2016 - 15:29:25
Dernière modification le : lundi 4 décembre 2017 - 15:14:11

Identifiants

Collections

Citation

Luca Mariot, Alberto Leporati. A Genetic Algorithm for Evolving Plateaued Cryptographic Boolean Functions. Theory and Practice of Natural Computing, Dec 2015, Mieres, Spain. 9477, pp.33-45, 2015, Lecture Notes in Computer Science. 〈10.1007/978-3-319-26841-5_3〉. 〈hal-01313909〉

Partager

Métriques

Consultations de la notice

48