24 citations · 41 across the 45 of their papers we have counts for
12 papers · 1 filter
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…
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…
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 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…
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…
Building Correlation Immune Functions from Sets of Mutually Orthogonal Cellular Automata
Luca Mariot, Luca Manzoni
Correlation immune Boolean functions play an important role in the implementation of efficient masking countermeasures for side-channel attacks in cryptography. In this paper, we i…
Enumeration of Maximal Cycles Generated by Orthogonal Cellular Automata
Luca Mariot
Cellular Automata (CA) are an interesting computational model for designing Pseudorandom Number Generators (PRNG), due to the complex dynamical behavior they can exhibit depending…
On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata
Luca Mariot, Luca Manzoni
We investigate S-boxes defined by pairs of Orthogonal Cellular Automata (OCA), motivated by the fact that such CA always define bijective vectorial Boolean functions, and could thu…
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…
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…
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…
The Fifth International Students' Olympiad in Cryptography -- NSUCRYPTO: problems and their solutions
Anastasiya Gorodilova, Sergey Agievich, Claude Carlet +10
Problems and their solutions of the Fifth International Students' Olympiad in cryptography NSUCRYPTO'2018 are presented. We consider problems related to attacks on ciphers and hash…