Permutation generators of alternating groups
The problem of generation of permutations from small ones is especially important from a cryptographic point of view. This work explores the case This work addresses the design of cryptographic systems using elementary permutations, also called modules. These modules have a simple structure and are based on internal smaller permutations. Two cases have been considered. In the first, the modules apply internal permutations only. It has been proved that the composition of modules generates the alternating group for the number of binary inputs bigger than 2. In the second, DES-like modules are considered and it has been shown that for a large enough number of binary inputs, they produce the alternating group, as well.
Unable to display preview. Download preview PDF.
- J. Bovey and A. Williamson. The probability of generating the symmetric group. Bull. London Math. Soc., 10:91–96, 1978.Google Scholar
- D. Coppersmith and E. Grossman. Generators for certain alternating groups with applications to cryptography. SIAM Journal Appl. Math., 29(4):624–627, December 1975.Google Scholar
- S. Even and O. Goldreich. DES-like functions can generate the alternating group. IEEE Transaction on Inf. Theory, IT-29(6):863–865, November 1983.Google Scholar
- Data Encryption Standard. National bureau of standards. Federal Information Processing Standard Publication, January 1977. No.46.Google Scholar
- H. Wielandt. Finite permutation groups. Academic Press, New York, 1964.Google Scholar