In several combinatorial optimization problems arising in cryptography and design theory,
the admissible solutions must often satisfy a balancedness constraint, such as being …

The Boolean functions satisfying secure properties on the restricted sets of inputs are
studied recently due to their importance in the framework of the FLIP stream cipher …

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

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 …

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 …

Finding balanced, highly nonlinear Boolean functions is a difficult problem where it is not
known what nonlinearity values are possible to be reached in general. At the same time …

An interesting thread in the research of Boolean functions for cryptography and coding
theory is the study of secondary constructions: given a known function with a good …

We investigate the design of Orthogonal Latin Squares (OLS) by means of Genetic
Algorithms (GA) and Genetic Programming (GP). Since we focus on Latin squares …

The evolution of Boolean functions that can be used in cryptography is a topic well studied in
the last decades. Previous research, however, has focused on evolving Boolean functions …