Permutation generators of alternating groups
\textit{D. Coppersmith} and \textit{E. Grossman} have proved [in SIAM J. Appl. Math. 29, 624--627 (1975; Zbl 0333.20002)] that the alternating group on the vector space \(\mathrm{GF}(2)^k\) can be generated for certain \(k\)'s by easy generators, so called \(k\)-functions, which are involutions manipulating only one position depending on \(k\) others. The authors claim to get similar results by using modified generators, which they call \(k\)-permutations, which manipulate \(k\) positions, depending on a permutation of \(\mathrm{GF}^k\) applied to \(k\) other positions. These enable them to draw conclusions also for the data encryption standard (DES). The reviewer found it not easy to read this paper due to half sentences in the abstract, misprints and a main definition 2.1, which is not understandable as it stands. For the entire collection see [Zbl 0719.00030].
- scientific article; zbMATH DE number 863481
- scientific article; zbMATH DE number 894528
- scientific article; zbMATH DE number 1261512
- Permutation groups
- Generator sets for the alternating group
- Generating alternating groups
- Random generation of permutations of the symmetric group or the alternating group
- scientific article; zbMATH DE number 278881
- scientific article; zbMATH DE number 4134288
- Invariable generation of permutation and linear groups
- Combinatorics of the group of parity alternating permutations
- Generation of the alternating group by modular additions
- DES-like functions can generate the alternating group
- On sufficient conditions to generate the alternating group by \(SA\)-permutations
- scientific article; zbMATH DE number 503331 (Why is no real title available?)
- Permutation statistics on the alternating group
This page was built for publication: Permutation generators of alternating groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972879)
