Permutation generators of alternating groups (Q3972879)

\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].