24 citations · 41 across the 45 of their papers we have counts for
8 papers · 1 filter
Bent Functions in the Partial Spread Class Generated by Linear Recurring Sequences
Maximilien Gadouleau, Luca Mariot, Stjepan Picek
We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defi…
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…
Heuristic Search of (Semi-)Bent Functions based on Cellular Automata
Luca Mariot, Martina Saletta, Alberto Leporati +1
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 cryptograp…
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…
Hip to Be (Latin) Square: Maximal Period Sequences from Orthogonal Cellular Automata
Luca Mariot
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…
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…
On the Genotype Compression and Expansion for Evolutionary Algorithms in the Continuous Domain
Lucija Planinic, Marko Djurasevic, Luca Mariot +3
This paper investigates the influence of genotype size on evolutionary algorithms' performance. We consider genotype compression (where genotype is smaller than phenotype) and expa…