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 2026Show all

5 papers · 1 filter

cs.FL2026

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…

cs.NE2026

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,…

cs.CR2026

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…

cs.NE2026

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…

cs.CR2026

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…