Regular subgroups with large intersection (Q2009075): Difference between revisions

A block cipher (and the round functions composing such a cipher) can be regarded as a set of keyed permutations on the message space \(V=\mathbb{F}_2^n\). The security of the cipher can be measured by comparing these permutations to the set of affine functions on \(V\) (with respect to the XOR operation). In his Ph.D. thesis, \textit{M. Calderini} [On Boolean functions, symmetric cryptography and algebraic coding theory. Trento: University of Trento (PhD Thesis) (2015)], studied a class of operations coming from copies of the usual translation group on \(V\) for investigating possible weaknesses in a block cipher with respect to these operations. A class of such operations were then used for investigating a possible differential cryptanalysis on bolck ciphers in [\textit{R. Civino} et al., Des. Codes Cryptography 87, No. 2--3, 225--247 (2019; Zbl 1454.94059)]. These works motivated the present paper, which investigates pairs of regular elementary abelian subgroups of Sym(V), with the aim of finding information about their (affine) normalisers when the pairs have large intersection.