activity
20142026
most citedRegular subgroups with large intersection

11 citations · 46 across the 20 of their papers we have counts for

collaborators

20 papers

math.CO2026

A Geometric Characterization of Maximal Unrefinable Partitions via the Keith-Nath Transformation and Young Diagrams

Riccardo Aragona, Roberto Civino, Lorenzo Campioni

We investigate the combinatorial structure of unrefinable partitions through their correspondence with numerical sets and Young diagrams. Building on the bijection introduced by Ke…

math.RA2025

Classification of small binary bibraces via bilinear maps

Roberto Civino, Valerio Fedele

We classify small binary bibraces, using the correspondence with alternating algebras over the field F2, up to dimension eight, also determining their isomorphism classes. These fi…

math.GR2024

Binary bi-braces and applications to cryptography

Roberto Civino, Valerio Fedele

In a XOR-based alternating block cipher the plaintext is masked by a sequence of layers each performing distinct actions: a highly nonlinear permutation, a linear transformation, a…

cs.CR2024

Optimal s-boxes against alternative operations and linear propagation

Marco Calderini, Roberto Civino, Riccardo Invernizzi

Civino et al. (2019) have shown how some diffusion layers can expose a Substitution-Permutation Network to vulnerability from differential cryptanalysis when employing alternative…

cs.CR2024

Differential experiments using parallel alternative operations

Marco Calderini, Roberto Civino, Riccardo Invernizzi

The use of alternative operations in differential cryptanalysis, or alternative notions of differentials, are lately receiving increasing attention. Recently, Civino et al. managed…

math.CO2023

A definitely periodic chain in the integral Lie ring of partitions

Riccardo Aragona, Roberto Civino, Norberto Gavioli

Given an integer , we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts i…

math.RA2023

A modular idealizer chain and unrefinability of partitions with repeated parts

Riccardo Aragona, Roberto Civino, Norberto Gavioli

Recently Aragona et al. have introduced a chain of normalizers in a Sylow 2-subgroup of Sym(2^n), starting from an elementary abelian regular subgroup. They have shown that the ind…

math.CO2022

The number of maximal unrefinable partitions

Riccardo Aragona, Lorenzo Campioni, Roberto Civino

This paper completes the classification of maximal unrefinable partitions, extending a previous work of Aragona et al. devoted only to the case of triangular numbers. We show that…

math.CO2021

Verification and generation of unrefinable partitions

Riccardo Aragona, Lorenzo Campioni, Roberto Civino +1

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that…

math.CO2021

On the maximal part in unrefinable partitions of triangular numbers

Riccardo Aragona, Lorenzo Campioni, Roberto Civino +1

A partition into distinct parts is refinable if one of its parts can be replaced by two different integers which do not belong to the partition and whose sum is , and it is…

math.CO2021★ 2 cited

Unrefinable partitions into distinct parts in a normalizer chain

Riccardo Aragona, Roberto Civino, Norberto Gavioli +1

In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain…

math.GR2021

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…

cs.CR2020★ 7 cited

On the primitivity of Lai-Massey schemes

Riccardo Aragona, Roberto Civino

In symmetric cryptography, the round functions used as building blocks for iterated block ciphers are often obtained as the composition of different layers providing confusion and…

math.GR2020★ 8 cited

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…

math.GR2020★ 5 cited

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…

cs.CR2020

An Authenticated Key Scheme over Elliptic Curves for Topological Networks

Riccardo Aragona, Roberto Civino, Norberto Gavioli +1

Nodes of sensor networks may be resource-constrained devices, often having a limited lifetime, making sensor networks remarkably dynamic environments. Managing a cryptographic prot…

math.GR2019★ 3 cited

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…

math.GR2018★ 11 cited

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…

math.GR2017

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…

cs.CR2014★ 10 cited

On the Equivalence of Two Security Notions for Hierarchical Key Assignment Schemes in the Unconditional Setting

Massimo Cafaro, Roberto Civino, Barbara Masucci

The access control problem in a hierarchy can be solved by using a hierarchical key assignment scheme, where each class is assigned an encryption key and some private information.…