activity
20162026
most citedMutually Orthogonal Latin Squares based on Cellular Automata

24 citations · 41 across the 45 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

cs.NE2025

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…

cs.NE2025

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…

cs.DM2025

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…

math.CO2025

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…

cs.NE2025

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…