Bent Function Synthesis by Means of Cartesian Genetic Programming

被引：0
|
作者：
Hrbacek, Radek [1 ]
Dvorak, Vaclav [1 ]
机构：
[1] Brno Univ Technol, Fac Informat Technol, Brno 61266, Czech Republic
来源：
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XIII | 2014年 / 8672卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：414 / 423
页数：10
相关论文
共 50 条
  • [21] Optimal Trajectories Synthesis of a Mobile Robots Group Using Cartesian Genetic Programming
    Diveev, Askhat
    Balandina, Galina
    2020 7TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'20), VOL 1, 2020, : 130 - 135
  • [22] Reduction of Fitness Calculations in Cartesian Genetic Programming
    Burian, Petr
    2013 INTERNATIONAL CONFERENCE ON APPLIED ELECTRONICS (AE), 2013, : 53 - 58
  • [23] Redundancy and computational efficiency in Cartesian genetic programming
    Miller, JF
    Smith, SL
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (02) : 167 - 174
  • [24] Cartesian Genetic Programming Based Optimization and Prediction
    Seo, Kisung
    Hyeon, Byeongyong
    NEW PERSPECTIVES IN INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 1, 2014, 275 : 497 - 502
  • [25] Positional independence and recombination in Cartesian Genetic Programming
    Cai, Xinye
    Smith, Stephen L.
    Tyrrell, Andy M.
    GENETIC PROGRAMMING, PROCEEDINGS, 2006, 3905 : 351 - 360
  • [26] On the Time Complexity of Simple Cartesian Genetic Programming
    Kalkreuth, Roman
    Droschinsky, Andre
    IJCCI: PROCEEDINGS OF THE 11TH INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL INTELLIGENCE, 2019, : 172 - 179
  • [27] FMCGP: frameshift mutation cartesian genetic programming
    Wei Fang
    Mindan Gu
    Complex & Intelligent Systems, 2021, 7 : 1195 - 1206
  • [28] GECCO 2012 Tutorial: Cartesian Genetic Programming
    Miller, Julian F.
    Harding, Simon L.
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION COMPANION (GECCO'12), 2012, : 1093 - 1116
  • [29] Refining Mutation Variants in Cartesian Genetic Programming
    Cui, Henning
    Margraf, Andreas
    Haehner, Joerg
    BIOINSPIRED OPTIMIZATION METHODS AND THEIR APPLICATIONS, 2022, 13627 : 185 - 200
  • [30] GECCO 2010 Tutorial: Cartesian Genetic Programming
    Miller, Julian F.
    Harding, Simon L.
    GECCO-2010 COMPANION PUBLICATION: PROCEEDINGS OF THE 12TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2010, : 2926 - +
12345