24 citations · 105 across the 16 of their papers we have counts for
19 papers
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…
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…
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…
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…
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…