 |
    |
Bent Function Synthesis by Means of Cartesian Genetic Programming
Radek Hrbacek and Vaclav Dvorak
Brno University of Technology, Faculty of Information Technology Bozetechova 2, 61266, Brno, Czech republicihrbacek@fit.vutbr.cz
dvorak@fit.vutbr.cz
http://www.fit.vutbr.cz/~ihrbacek/
Abstract. In this paper, a new approach to synthesize bent Boolean functions by means of Cartesian Genetic Programming (CGP) is proposed. Bent functions have important applications in cryptography due to their high nonlinearity. However, they are very rare and their discovery using conventional brute force methods is not efficient enough. We show that by using CGP we can routinely design bent functions of up to 16 variables. The evolutionary approach exploits parallelism in both the fitness calculation and the search algorithm.
LNCS 8672, p. 414 ff.
lncs@springer.com
© Springer International Publishing Switzerland 2014