Abstract
Absolute lower limits to the cost of cryptanalytic attacks are quantified, via a theory of guesswork. Conditional guesswork naturally expresses limits to known and chosen plaintext attacks. New inequalities are derived between various forms of guesswork and variation distance. The machinery thus offers a new technique for establishing the security of a cipher: When the work-factor of the optimal known or chosen plaintext attack against a cipher is bounded below by a prohibitively large number, then no practical attack against the cipher can succeed. As an example, we apply the technique to iterated cryptosystems, as the Markov property which results from an independent subkey assumption makes them particularly amenable to analysis.
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
David J. Aldous and Persi Diaconis. Shuffling cards and stopping times. Amer. Math. Monthly, 93:333–348, 1986.
Eli Biham and Adi Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, New York, 1993.
Christian Cachin. Entropy Measures and Unconditional Security in Cryptography. PhD thesis, ETH Zürich, 1997.
Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. John Wiley & Sons, New York, 1991.
Persi Diaconis. Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, CA, 1988.
John D. Dixon and Brian Mortimer. Permutation Groups. Springer-Verlag, New York, 1996.
William Fulton and Joe Harris. Representation Theory: A First Course. Springer-Verlag, New York, 1991.
G. R. Grimmett and D. R. Stirzaker. Probability and Random Processes. Oxford University Press, Oxford, 2nd edition, 1992.
Xuejia Lai, James L. Massey, and Sean Murphy. Markov ciphers and differentical cryptanalysis. In D. W. Davies, editor, Advances in Cryptology-EUROCRYPT’ 91, pages 17–38, Berlin, 1991. Springer-Verlag.
M. O. Lorenz. Methods of measuring concentration of wealth. J. Amer. Statist. Assoc., 9:209–219, 1905.
Michael Luby and Charles Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Jour. Comput., 75(2), 1988.
Albert W. Marshall and Ingram Olkin. Inequalities: Theory of Majorization and Its Applications. Academic Press, San Diego, 1979.
James L. Massey. Guessing and entropy. Proc. 1994 IEEE Int’l Symp. on Information Theory, page 204, 1994.
Alec Muffett. Crack Version 5.0a User Manual. URL: ftp://ftp.cert.org/pub/tools/crack/.
Moni Naor and Omer Reingold. On the construction of pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryptology, 12:29–66, 1999.
Kaisa Nyberg and Lars Ramkilde Knudsen. Provable security against a differential attack. Journal of Cryptology, 8:27–37, 1995.
Luke O’Connor and Jovan Dj. Golić. A unified Markov approach to differential and linear cryptanalysis. In Josef Pieprzyk and Reihanah Safavi-Naini, editors, Advances in Cryptology-ASIACRYPT’ 94, pages 387–397, New York, 1994. Springer-Verlag.
John O. Pliam. Ciphers and their Products: Group Theory in Private Key Cryptography. PhD thesis, University of Minnesota, July 1999.
Joseph J. Rotman. An Introduction to the Theory of Groups. Wm. C. Brown, Dubuque, IA, 3rd edition, 1988.
Claude E. Shannon. Communication theory of secrecy systems. Bell System Tech. Jour., 28:656–715, 1949.
Serge Vaudenay. Provable security for block ciphers by decorrelation. In STACS’ 98, pages 249–275, Berlin, 1998. Springer-Verlag.
Serge Vaudenay. The decorrelation technique, 1999. URL: http://www.dmi.ens.fr/~vaudenay/decorrelation.html.
Ralph Wernsdorf. The one-round functions of DES generate the alternating group. In R.A. Reuppel, editor, Advances in Cryptology-EUROCRYPT’ 92, pages 99–112, Berlin, 1993. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pliam, J.O. (2000). Guesswork and Variation Distance as Measures of Cipher Security. In: Heys, H., Adams, C. (eds) Selected Areas in Cryptography. SAC 1999. Lecture Notes in Computer Science, vol 1758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46513-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-46513-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67185-5
Online ISBN: 978-3-540-46513-3
eBook Packages: Springer Book Archive