Evolving Cryptographic Boolean Functions with Minimal Multiplicative Complexity

článek ve sborníku ve WoS nebo Scopus

angličtina

The multiplicative complexity (MC) is a cryptographic criterion that describes the vulnerability of a Boolean function to certain algebraic attacks, and in many important cryptographic applications also determines the computational cost. In this paper, we use Cartesian genetic programming to find various types of cryptographic Boolean functions, improve their implementation to achieve the minimal MC, and examine how difficult these optimized functions are to find in comparison to functions than only need to satisfy some base cryptographic criteria. To provide a comparison with other state-of-the-art optimization approaches, we also use our method to improve the implementation of several generic benchmark circuits. Our results provide new upper limits on MC of certain functions, show that our approach is competitive, and also that finding functions with an implementation that has better MC is not mutually exclusive with improving other performance criteria.

Genetic programming, Cartesian genetic programming, cryptography, multiplicative complexity, optimization.

HUSA, J.; SEKANINA, L.

3. 9. 2020

IEEE Computational Intelligence Society

Los Alamitos

978-1-7281-6929-3

2020 IEEE Congress on Evolutionary Computation (CEC)

1

8

8