Abstract
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.
Support for this project was provided in part by the Australian Research Council under the reference number A48830241 and by TELECOM Australia under the contract number 7027
Preview
Unable to display preview. Download preview PDF.
References
J. Bovey and A. Williamson. The probability of generating the symmetric group. Bull. London Math. Soc., 10:91–96, 1978.
D. Coppersmith and E. Grossman. Generators for certain alternating groups with applications to cryptography. SIAM Journal Appl. Math., 29(4):624–627, December 1975.
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.
Data Encryption Standard. National bureau of standards. Federal Information Processing Standard Publication, January 1977. No.46.
H. Wielandt. Finite permutation groups. Academic Press, New York, 1964.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pieprzyk, J., Zhang, XM. (1990). Permutation generators of alternating groups. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030365
Download citation
DOI: https://doi.org/10.1007/BFb0030365
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53000-8
Online ISBN: 978-3-540-46297-2
eBook Packages: Springer Book Archive