A chain of normalizers in the Sylow 2-subgroups of the symmetric group on 2ⁿ letters
From MaRDI portal
Publication:2065338
Abstract: 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 chain is defined as the normalizer of the previous one in the symmetric group on letters. Partial results and computational experiments lead us to conjecture that, for large values of , the index of a normalizer in the consecutive one does not depend on . Indeed, there is a strong evidence that the sequence of the logarithms of such indices is the one of the partial sums of the numbers of partitions into at least two distinct parts.
Recommendations
Cites work
- A note on the monotonicity of mixed Ramsey numbers
- A sequence defined by M-sequences
- Differential attacks: using alternative operations
- Differential cryptanalysis of DES-like cryptosystems
- 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 4067184 (Why is no real title available?)
- Maximal Abelian Subgroups of the Symmetric Groups
- On properties of translation groups in the affine general linear group with applications to cryptography
- PRESENT: An Ultra-Lightweight Block Cipher
- REGULAR SUBGROUPS OF THE AFFINE GROUP AND RADICAL CIRCLE ALGEBRAS
- Regular subgroups with large intersection
- The Sylow 2-subgroups of the finite classical groups
Cited in
(3)
This page was built for publication: A chain of normalizers in the Sylow 2-subgroups of the symmetric group on \({\mathbf{2}}^n\) letters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065338)