Zobrazeno 1 - 10
of 181
pro vyhledávání: '"MARIOT, LUCA"'
Evolving Boolean functions with specific properties is an interesting optimization problem since, depending on the combination of properties and Boolean function size, the problem can range from very simple to (almost) impossible to solve. Moreover,
Externí odkaz:
http://arxiv.org/abs/2411.12735
We consider the construction of maximal families of polynomials over the finite field $\mathbb{F}_q$, all having the same degree $n$ and a nonzero constant term, where the degree of the GCD of any two polynomials is $d$ with $1 \le d\le n$. The motiv
Externí odkaz:
http://arxiv.org/abs/2405.08741
Autor:
Mariot, Luca
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 in this field, except the very early works, seems to be published in
Externí odkaz:
http://arxiv.org/abs/2405.02875
Boolean functions are mathematical objects used in diverse applications. Different applications also have different requirements, making the research on Boolean functions very active. In the last 30 years, evolutionary algorithms have been shown to b
Externí odkaz:
http://arxiv.org/abs/2402.09937
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 permutation PSO by Hu, Eberhart and Shi which preserves the Hamming weigh
Externí odkaz:
http://arxiv.org/abs/2401.04567
Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to be a strong choice as they can provide many bent functions, even when t
Externí odkaz:
http://arxiv.org/abs/2311.11884
Autor:
Carlet, Claude, Ðurasevic, Marko, Gašperov, Bruno, Jakobovic, Domagoj, Mariot, Luca, Picek, Stjepan
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 functions in this class can have excellent properties, making them inter
Externí odkaz:
http://arxiv.org/abs/2311.11881
This paper presents the Smooth Number Message Authentication Code (SNMAC) for the context of lightweight IoT devices. The proposal is based on the use of smooth numbers in the field of cryptography, and investigates how one can use them to improve th
Externí odkaz:
http://arxiv.org/abs/2310.13954
Autor:
Formenti, Enrico, Mariot, Luca
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). The problem is equivalent to enumerating all pairs of coprime polynom
Externí odkaz:
http://arxiv.org/abs/2307.07505
Autor:
Anselmi, Fabio, Castelli, Mauro, d'Onofrio, Alberto, Manzoni, Luca, Mariot, Luca, Saletta, Martina
Geometric Semantic Geometric Programming (GSGP) is one of the most prominent Genetic Programming (GP) variants, thanks to its solid theoretical background, the excellent performance achieved, and the execution time significantly smaller than standard
Externí odkaz:
http://arxiv.org/abs/2305.16956