Abstract
There has been recent interest in the permutation group generated by the round functions of a block cipher. In this paper we present a cautionary example of a block cipher which generates the full symmetric group yet is very weak.
Article PDF
Similar content being viewed by others
References
D. Coppersmith and E. Grossman. Generators for certain alternating groups with applications to cryptology. SIAM Journal of Applied Mathematics, 29: 624–627, 1975.
S. Even and O. Goldreich. DES-like functions can generate the alternating group. IEEE Transactions on Information Theory, 29: 863–865, 1983.
S. S. Magliveras and N. D. Memon. Algebraic properties of cryptosystem PGM. Journal of Cryptology, 5: 167–184, 1992.
R. Wernsdorf. The one-round functions of DES generate the alternating group. Advances in Cryptology—EUROCRYPT 92 Proceedings, Lecture Notes in Computer Science, Vol. 658, Springer-Verlag, Berlin, 1993, pp. 99–112.
Author information
Authors and Affiliations
Additional information
Communicated by Dan Coppersmith
Rights and permissions
About this article
Cite this article
Murphy, S., Paterson, K. & Wild, P. A weak cipher that generates the symmetric group. J. Cryptology 7, 61–65 (1994). https://doi.org/10.1007/BF00195210
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00195210