Abstract
This paper includes some relations between differential cryptanalysis and group theory. The main result is the following: If the one-round functions of an r-round iterated cipher generate the alternating or the symmetric group, then for all corresponding Markov ciphers the chains of differences are irreducible and aperiodic.
As an application it will be shown that if the hypothesis of stochastic equivalence holds for any of these corresponding Markov ciphers, then the DES and the IDEA(32) are secure against a differential cryptanalysis attack after sufficiently many rounds for these Markov ciphers.
The section about IDEA(32) includes the result that the one-round functions of this algorithm generate the alternating group.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Even, S.; Goldreich, O. DES-like Functions Can Generate the Alternating Group IEEE Transactions on Information Theory, IT-29, Nr. 6, 1983, 863–865
Feller, W. An Introduction to Probability Theory and Its Applications Volume I, Second Edition 1958 John Wiley & Sons, Inc., New York
Lai, X. On the Design and Security of Block Ciphers ETH Series in Information Processing, v.1 (Dissertation) Hartung-Gorre Verlag, Konstanz, 1992
Lai, X.; Massey, J. L.; Murphy, S. Markov Ciphers and Differential Cryptanalysis Proc. EUROCRYPT’ 91, LNCS 547, 1991, 17–38
Data Encryption Standard (DES) US NBS, FIPS PUB 46, 1977, Washington
Robinson, D. J. S. A Course in the Theory of Groups Graduate Texts in Mathematics, Springer, 1982, New York
Wernsdorf, R. The One-Round Functions of the DES Generate the Alternating Group Proc. EUROCRYPT’ 92, LNCS 658, 1993, 99–112
Wielandt, H. Finite Permutation Groups Academic Press, 1964, New York and London
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hornauer, G., Stephan, W., Wernsdorf, R. (1994). Markov Ciphers and Alternating Groups. In: Helleseth, T. (eds) Advances in Cryptology — EUROCRYPT ’93. EUROCRYPT 1993. Lecture Notes in Computer Science, vol 765. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48285-7_41
Download citation
DOI: https://doi.org/10.1007/3-540-48285-7_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57600-6
Online ISBN: 978-3-540-48285-7
eBook Packages: Springer Book Archive