24 citations · 41 across the 45 of their papers we have counts for
28 papers · 1 filter
Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity
Claude Carlet, Marko Čupić, Marko Ðurasevic +3
Monotone Boolean functions are a structurally important class of Boolean functions, but their restricted form imposes strong limitations on achievable nonlinearity. In this paper,…
NegaBent, No Regrets: Evolving Spectrally Flat Boolean Functions
Claude Carlet, Marko Ðurasevic, Ermes Franch +3
Negabent Boolean functions are defined by having a flat magnitude spectrum under the nega-Hadamard transform. They exist in both even and odd dimensions, and the subclass of functi…
On Counts and Densities of Homogeneous Bent Functions: An Evolutionary Approach
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +3
Boolean functions with strong cryptographic properties, such as high nonlinearity and algebraic degree, are important for the security of stream and block ciphers. These functions…
A Systematic Study on the Design of Odd-Sized Highly Nonlinear Boolean Functions via Evolutionary Algorithms
Claude Carlet, Marko Đurasevic, Domagoj Jakobovic +2
This paper focuses on the problem of evolving Boolean functions of odd sizes with high nonlinearity, a property of cryptographic relevance. Despite its simple formulation, this pro…
Degree is Important: On Evolving Homogeneous Boolean Functions
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Boolean functions with good cryptographic properties like high nonlinearity and algebraic degree play an important in the security of stream and block ciphers. Such functions may b…
The More the Merrier: On Evolving Five-valued Spectra Boolean Functions
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Evolving Boolean functions with specific properties is an interesting optimization problem since, depending on the combination of properties and Boolean function size, the problem…
A Systematic Evaluation of Evolving Highly Nonlinear Boolean Functions in Odd Sizes
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Boolean functions are mathematical objects used in diverse applications. Different applications also have different requirements, making the research on Boolean functions very acti…
A Discrete Particle Swarm Optimizer for the Design of Cryptographic Boolean Functions
Luca Mariot, Alberto Leporati, Luca Manzoni
A Particle Swarm Optimizer for the search of balanced Boolean functions with good cryptographic properties is proposed in this paper. The algorithm is a modified version of the per…
Look into the Mirror: Evolving Self-Dual Bent Boolean Functions
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to b…
A New Angle: On Evolving Rotation Symmetric Boolean Functions
Claude Carlet, Marko Ðurasevic, Bruno Gašperov +3
Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions. At the same time, the fu…
Local Search, Semantics, and Genetic Programming: a Global Analysis
Fabio Anselmi, Mauro Castelli, Alberto d'Onofrio +3
Geometric Semantic Geometric Programming (GSGP) is one of the most prominent Genetic Programming (GP) variants, thanks to its solid theoretical background, the excellent performanc…
Digging Deeper: Operator Analysis for Optimizing Nonlinearity of Boolean Functions
Marko Djurasevic, Domagoj Jakobovic, Luca Mariot +1
Boolean functions are mathematical objects with numerous applications in domains like coding theory, cryptography, and telecommunications. Finding Boolean functions with specific p…
NASCTY: Neuroevolution to Attack Side-channel Leakages Yielding Convolutional Neural Networks
Fiske Schijlen, Lichao Wu, Luca Mariot
Side-channel analysis (SCA) can obtain information related to the secret key by exploiting leakages produced by the device. Researchers recently found that neural networks (NNs) ca…
On the Evolution of Boomerang Uniformity in Cryptographic S-boxes
Marko Djurasevic, Domagoj Jakobovic, Luca Mariot +2
S-boxes are an important primitive that help cryptographic algorithms to be resilient against various attacks. The resilience against specific attacks can be connected with a certa…
Evolutionary Strategies for the Design of Binary Linear Codes
Claude Carlet, Luca Mariot, Luca Manzoni +1
The design of binary error-correcting codes is a challenging optimization problem with several applications in telecommunications and storage, which has also been addressed with me…
The Influence of Local Search over Genetic Algorithms with Balanced Representations
Luca Manzoni, Luca Mariot, Eva Tuba
We continue the study of Genetic Algorithms (GA) on combinatorial optimization problems where the candidate solutions need to satisfy a balancedness constraint. It has been observe…
The Effect of Multi-Generational Selection in Geometric Semantic Genetic Programming
Mauro Castelli, Luca Manzoni, Luca Mariot +2
Among the evolutionary methods, one that is quite prominent is Genetic Programming, and, in recent years, a variant called Geometric Semantic Genetic Programming (GSGP) has shown t…
Evolving Constructions for Balanced, Highly Nonlinear Boolean Functions
Claude Carlet, Marko Djurasevic, Domagoj Jakobovic +2
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,…
Evolutionary Construction of Perfectly Balanced Boolean Functions
Luca Mariot, Stjepan Picek, Domagoj Jakobovic +2
Finding Boolean functions suitable for cryptographic primitives is a complex combinatorial optimization problem, since they must satisfy several properties to resist cryptanalytic…
Modeling Strong Physically Unclonable Functions with Metaheuristics
Carlos Coello Coello, Marko Djurasevic, Domagoj Jakobovic +2
Evolutionary algorithms have been successfully applied to attacking Physically Unclonable Functions (PUFs). CMA-ES is recognized as the most powerful option for a type of attack ca…
On the Difficulty of Evolving Permutation Codes
Luca Mariot, Stjepan Picek, Domagoj Jakobovic +2
Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline commu…
Deriving Smaller Orthogonal Arrays from Bigger Ones with Genetic Algorithm
Luca Mariot
We consider the optimization problem of constructing a binary orthogonal array (OA) starting from a bigger one, by removing a specified amount of lines. In particular, we develop a…
Salp Swarm Optimization: a Critical Review
Mauro Castelli, Luca Manzoni, Luca Mariot +2
In the crowded environment of bio-inspired population-based metaheuristics, the Salp Swarm Optimization (SSO) algorithm recently appeared and immediately gained a lot of momentum.…
Evolutionary Algorithms for Designing Reversible Cellular Automata
Luca Mariot, Stjepan Picek, Domagoj Jakobovic +1
Reversible Cellular Automata (RCA) are a particular kind of shift-invariant transformations characterized by a dynamics composed only of disjoint cycles. They have many application…