21 citations · 110 across the 29 of their papers we have counts for
12 papers · 1 filter
On the primitivity of the AES-128 key-schedule
Riccardo Aragona, Roberto Civino, Francesca Dalla Volta
The key-scheduling algorithm in the AES is the component responsible for selecting from the master key the sequence of round keys to be xor-ed to the partially encrypted state at e…
Rigid commutators and a normalizer chain
Riccardo Aragona, Roberto Civino, Norberto Gavioli +1
The novel notion of rigid commutators is introduced to determine the sequence of the logarithms of the indices of a certain normalizer chain in the Sylow 2-subgroup of the symmetri…
A Chain of Normalizers in the Sylow -subgroups of the symmetric group on letters
Riccardo Aragona, Roberto Civino, Norberto Gavioli +1
On the basis of an initial interest in symmetric cryptography, in the present work we study a chain of subgroups. Starting from a Sylow -subgroup of AGL(2,n), each term of the c…
Some group-theoretical results on Feistel Networks in a long-key scenario
Riccardo Aragona, Marco Calderini, Roberto Civino
The study of the trapdoors that can be hidden in a block cipher is and has always been a high-interest topic in symmetric cryptography. In this paper we focus on Feistel-network-li…
Regular subgroups with large intersection
Riccardo Aragona, Roberto Civino, Norberto Gavioli +1
In this paper we study the relationships between the elementary abelian regular subgroups and the Sylow -subgroups of their normalisers in the symmetric group $\mathrm{Sym}(\mat…
Type-Preserving Matrices and Security of Block Ciphers
Riccardo Aragona, Alessio Meneghetti
We provide a new property, called Non-Type-Preserving, for a mixing layer which guarantees protection against algebraic attacks based on the imprimitivity of the group generated by…
Wave-Shaped Round Functions and Primitive Groups
Riccardo Aragona, Marco Calderini, Roberto Civino +2
Round functions used as building blocks for iterated block ciphers, both in the case of Substitution-Permutation Networks and Feistel Networks, are often obtained as the compositio…
On the primitivity of PRESENT and other lightweight ciphers
Riccardo Aragona, Marco Calderini, Antonio Tortora +1
We provide two sufficient conditions to guarantee that the round functions of a translation based cipher generate a primitive group. Furthermore, under the same hypotheses, and ass…
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…
The role of Boolean functions in hiding sums as trapdoors for some block ciphers
Riccardo Aragona, Marco Calderini, Massimiliano Sala
Most modern block ciphers are built using components whose cryptographic strength is evaluated in terms of their resistance to attacks on the whole cipher. In particular, different…
On the group generated by the round functions of translation based ciphers over arbitrary finite fields
R. Aragona, A. Caranti, F. Dalla Volta +1
We define a translation based cipher over an arbitrary finite field, and study the permutation group generated by the round functions of such a cipher. We show that under certain c…