Abstract
Differential cryptanalysis is a general attack based on the notion of differences. The success of the attack is derived from the proba- bility of a differential. While it has been observed that the distribution of differentials can be modeled as a Markov chain, there have been few anal- yses that take advantage of this observation because of the prohibitive computations involved. In this paper we apply the Markov approach to the differentially 2-uniform mappings, and show that they converge ex- ponentially fast with high probability.
The work reported in this paper has been funded in part by the Cooperative Research Centres program through the Department of the Prime Minister and Cabinet of Australia. Correspondence should be sent to DSTC, ITE Building, QUT GP, GPO Box 2434, Brisbane Q 4001, Australia. Email: oconnor@dstc.edu.au.
Chapter PDF
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
U. Bhat. Elements in applied stochastic processes. John Wiley and Sons, 1972.
E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 4(1):3–72, 1991.
E. Biham and A. Shamir. Differential cryptanalysis of Data Encryption Standard. Springer-Verlag. 1993.
B. Bollobás. Random graphs. Academic Press, 1985.
P. Diaconis and D. Stroock. Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability, 1(1):37–61, 1991.
W. Feller. An Introduction to Probability Theory and its Applications.New York: Wiley, 3rd edition, Volume 1, 1968.
J. Fill. Eigenvalne bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Annals of Applied Probability, 1(1):62–87, 1991.
G. Hornauer, W. Stephan, and R. Wernsdorf. Markov ciphers and alternating groups. Advances in Cryptology, EUROCRYPT 93, Lecture Notes in Computer Science. vol. 765, T. Helleseth ed., Springer-Verlag, pages 453–460, 1994.
X. Lai. On the design and security of block ciphers. ETH Series in Information Processing, editor J. Massey, Hartung-Gorre Verlag Konstanz, 1992.
X. Lai, J. Massey, and S. Murphy. Markov ciphers and differential analysis. In Advances in Cryptology, EUROCRYPT 91, Lecture Notes in Computer Science, col. 547. D. W. Davies ed., Springer-Verlag, pages 17–38, 1991.
K. Nyberg. Differentially uniform mappings for cryptography. Advances in Cryptology, EUROCRYPT 93, Lecture Notes in Computer Science, vol. 765, T. Helleseth ed., Springer-Verlag, pages 55–64, 1994.
L. J. O’Connor. Desiguing product ciphers using Markov chains. proceedings of the Workshop on Selected Areas in Cryptography, Kingston, Canada, May 1994, pages 2–13, 1994.
L. J. O’Connor and J. Dj Golić. A unified markov approach to differential and lincar cryptanalysis. to be presented at Asiacrypt, November 1994.
National Bureau of Standards. Data Encryption Standard. FIPS PUB 46, Wash-ington, D. C. (January 1977).
I. Palásti. On the strong connectedness of random graphs. Studia Sci. Math. Hungar., 1:205–214, 1966.
U. Vazirani. Rapidly mixing Markov chains. In B. Bollobás, editor, Probabilistic combinatorics and its applications, proceedings of Symposia in Applied Mathematics, volume 44, pages 99–121, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O’Connor, L. (1995). Convergence in Differential Distributions. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_2
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive