24 citations · 41 across the 45 of their papers we have counts for
53 papers
On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
Alberto Dennunzio, Maximilien Gadouleau, Luca Mariot
In this short paper, we begin to investigate the conditions under which a generic Bipermutive Cellular Automaton (BCA) with no-boundary conditions of diameter generates a Latin…
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,…
How to reconstruct (anonymously) a secret cellular automaton
Luca Mariot, Federico Mazzone, Luca Manzoni +1
We consider threshold secret sharing schemes based on cellular automata (CA) that allows for anonymous reconstruction, meaning that the secret can be recovered only as a function o…
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…
IDEM Enough? Evolving Highly Nonlinear Idempotent Boolean Functions
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invarian…
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…
Self-Orthogonal Cellular Automata
Luca Mariot, Federico Mazzone
It is known that no-boundary Cellular Automata (CA) defined by bipermutive local rules give rise to Latin squares. In this paper, we study under which conditions the Latin square g…
Combinatorial Designs and Cellular Automata: A Survey
Luca Manzoni, Luca Mariot, Giuliamaria Menara
Cellular Automata (CA) are commonly investigated as a particular type of dynamical systems, defined by shift-invariant local rules. In this paper, we consider instead CA as algebra…
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…
On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
Maximilien Gadouleau, Luca Mariot, Federico Mazzone
We consider the construction of maximal families of polynomials over the finite field , all having the same degree and a nonzero constant term, where the degree o…
Insights Gained after a Decade of Cellular Automata-based Cryptography
Luca Mariot
Cellular Automata (CA) have been extensively used to implement symmetric cryptographic primitives, such as pseudorandom number generators and S-boxes. However, most of the research…
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…
Exhaustive Generation of Linear Orthogonal Cellular Automata
Enrico Formenti, Luca Mariot
We consider the problem of exhaustively visiting all pairs of linear cellular automata which give rise to orthogonal Latin squares, i.e., linear Orthogonal Cellular Automata (OCA).…
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…
On the Minimum Distance of Subspace Codes Generated by Linear Cellular Automata
Luca Mariot, Federico Mazzone
Motivated by applications to noncoherent network coding, we study subspace codes defined by sets of linear cellular automata (CA). As a first remark, we show that a family of linea…
A classification of S-boxes generated by Orthogonal Cellular Automata
Luca Mariot, Luca Manzoni
Most of the approaches published in the literature to construct S-boxes via Cellular Automata (CA) work by either iterating a finite CA for several time steps, or by a one-shot app…
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…
A Survey of Metaheuristic Algorithms for the Design of Cryptographic Boolean Functions
Marko Djurasevic, Domagoj Jakobovic, Luca Mariot +1
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an importa…