28 citations · 173 across the 55 of their papers we have counts for
13 papers · 1 filter
An algorithmic approach using multivariate polynomials for the nonlinearity of Boolean functions
Emanuele Bellini, Teo Mora, Massimiliano Sala
The nonlinearity of a Boolean function is a key property in deciding its suitability for cryptographic purposes, e.g. as a combining function in stream ciphers, and so the nonlinea…
On optimal nonlinear systematic codes
Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala
Most bounds on the size of codes hold for any code, whether linear or not. Notably, the Griesmer bound holds only in the linear case and so optimal linear codes are not necessarily…
A deterministic algorithm for the distance and weight distribution of binary nonlinear codes
Emanuele Bellini, Massimiliano Sala
Given a binary nonlinear code, we provide a deterministic algorithm to compute its weight and distance distribution, and in particular its minimum weight and its minimum distance,…
Code generator matrices as RNG conditioners
Alessandro Tomasi, Alessio Meneghetti, Massimiliano Sala
We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connecti…
On the Griesmer bound for nonlinear codes
Emanuele Bellini, Eleonora Guerrini, Alessio Meneghetti +1
Most bounds on the size of codes hold for any code, whether linear or nonlinear. Notably, the Griesmer bound, holds only in the linear case. In this paper we characterize a family…
A weight-distribution bound for entropy extractors using linear binary codes
Alessio Meneghetti, Massimiliano Sala, Alessandro Tomasi
We consider a bound on the bias reduction of a random number generator by processing based on binary linear codes. We introduce a new bound on the total variation distance of the p…