An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
From MaRDI portal
Publication:735032
Abstract: In a previous paper, we had proved that the permutation group generated by the round functions of an AES-like cipher is primitive. Here we apply the O'Nan Scott classification of primitive groups to prove that this group is the alternating group.
Recommendations
- On the group generated by the round functions of translation based ciphers over arbitrary finite fields
- The group generated by the round functions of a GOST-like cipher
- Group theoretic properties of Rijndael-like ciphers
- scientific article; zbMATH DE number 3863091
- The cryptanalysis of a public-key implementation of finite group mappings
- The construction of a finite cyclic group applied in asymmetric encryption
- scientific article; zbMATH DE number 2156406
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- An application of quasigroups in cryptology
- On properties of translation groups in the affine general linear group with applications to cryptography
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 5150119 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 503331 (Why is no real title available?)
- scientific article; zbMATH DE number 1942409 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- scientific article; zbMATH DE number 1418254 (Why is no real title available?)
- Communication Theory of Secrecy Systems*
- Generators for Certain Alternating Groups with Applications to Cryptography
- Group theoretic properties of Rijndael-like ciphers
- Inverse-closed additive subgroups of fields
- Inversion invariant additive subgroups of division rings
- Is the data encryption standard a group? (Results of cycling experiments on DES)
- On some block ciphers and imprimitive groups
- Subgroups of prime power index in a simple group
- The Finite Primitive Permutation Groups Containing an Abelian Regular Subgroup
- The Round Functions of RIJNDAEL Generate the Alternating Group
- Understanding Two-Round Differentials in AES
Cited in
(18)- The \(t\)-wise independence of substitution-permutation networks
- Group properties of block ciphers of the Russian standards GOST R 34.11-2012 and GOST R 34.12-2015
- A note on some algebraic trapdoors for block ciphers
- A property of the inverse of a subspace of a finite field
- Compositions and parities of complete mappings and of orthomorphisms
- On some block ciphers and imprimitive groups
- Wave-shaped round functions and primitive groups
- Some group-theoretical results on Feistel networks in a long-key scenario
- On the group generated by the round functions of translation based ciphers over arbitrary finite fields
- Primitivity of the group of a cipher involving the action of the key-schedule
- Primitivity of PRESENT and other lightweight ciphers
- On differential uniformity of maps that may hide an algebraic trapdoor
- Type-preserving matrices and security of block ciphers
- A note on an infeasible linearization of some block ciphers
- Inversion and subspaces of a finite field
- On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion
- The group generated by the round functions of a GOST-like cipher
- On the image of an affine subspace under the inverse function within a finite field
This page was built for publication: An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735032)