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

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 …

Orthogonal Arrays (OA) represent an interesting breed of combinatorial designs that finds
applications in several domains such as statistics, coding theory, and cryptography. In this …

In this work, we present a primary construction of bent functions based on cellular automata
(CA). We consider the well-known characterization of bent functions in terms of Hadamard …

Orthogonal Cellular Automata (OCA) have been recently investigated in the literature as a
new approach to construct orthogonal Latin squares for cryptographic applications such as …

Boolean functions have a prominent role in many real-world applications, which makes them
a very active research domain. Throughout the years, various heuristic techniques proved to …

Abstract Reversible Cellular Automata (RCA) are a particular kind of shift-invariant
transformations characterized by dynamics composed only of disjoint cycles. They have …

Abstract Mutually Orthogonal Cellular Automata (MOCA) are sets of bipermutive CA which
can be used to construct pairwise orthogonal Latin squares. In this work, we consider the …

The use of balanced crossover operators in Genetic Algorithms (GA) ensures that the binary
strings generated as offsprings have the same Hamming weight of the parents, a constraint …