Cartesian genetic programming, a well-established method of genetic programming, is
approximately 20 years old. It represents solutions to computational problems as graphs. Its …

Cartesian Genetic Programming (CGP) is a variant of Genetic Programming with several
advantages. During the last one and a half decades, CGP has been further extended to …

Scheduling is an important process that is present in many real world scenarios where it is
essential to obtain the best possible results. The performance and execution time of …

Boolean functions are mathematical objects used in diverse domains and have been
actively researched for several decades already. One domain where Boolean functions play …

Boolean functions have numerous applications in domains as diverse as coding theory,
cryptography, and telecommunications. Heuristics play an important role in the construction …

Boolean functions are used as nonlinear filter functions and combiner functions in several
stream ciphers. The security of these stream ciphers largely depends upon cryptographic …

The role of Boolean functions is prominent in several areas including cryptography,
sequences, and coding theory. Therefore, various methods for the construction of Boolean …

Finding Boolean functions suitable for cryptographic primitives is a complex combinatorial
optimization problem, since they must satisfy several properties to resist cryptanalytic …

Abstract Cartesian Genetic Programming is often used with mutation as the sole genetic
operator. Compared to the fundamental knowledge about the effect and use of mutation in …

This chapter provides a general overview of AI methods used to support the design of
cryptographic primitives and protocols. After giving a brief introduction to the basic concepts …