28 citations · 173 across the 55 of their papers we have counts for
8 papers · 1 filter
A note on APN permutations in even dimension
Marco Calderini, Massimilano Sala, Irene Villa
APN permutations in even dimension are vectorial Boolean functions that play a special role in the design of block ciphers. We study their properties, providing some general result…
A note on an infeasible linearization of some block ciphers
Riccardo Aragona, Anna Rimoldi, Massimiliano Sala
A block cipher can be easily broken if its encryption functions can be seen as linear maps on a small vector space. Even more so, if its round functions can be seen as linear maps…
The group generated by the round functions of a GOST-like cipher
R. Aragona, A. Caranti, M. Sala
We define a cipher that is an extension of GOST, and study the permutation group generated by its round functions. We show that, under minimal assumptions on the components of the…
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…