Abstract
We discuss measures of statistical uncertainty relevant to determining random values in cryptology. It is shown that unbalanced and self-similar Huffman trees have extremal properties with respect to these measures.Their corresponding probability distributions exhibit an unbounded gap between (Shannon)entropy and the logarithm of the minimum search space size necessary to be guaranteed a certain chance of success (called marginal guesswork). Thus, there can be no general inequality between them. We discuss the implications of this result in terms of the security of weak secrets against brute-force searching attacks, and also in terms of Shannon’s uncertainty axioms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Robert B.Ash. Information Theory Dover, New York, 1965. 68, 69, 73, 73, 77
S.M. Bellovin and M. Merritt. Encrypted key exchange:Password-based protocols secure against dictionary attacks. In Proc. of the 1992 IEEE Comp. Soc. Symp. on Res. in Secur. and Priv. pages 72–84. IEEE Press, 1992. 71
Christian Cachin. Entropy Measures and Unconditional Security in Cryptography PhD thesis, ETH Zürich, 1997. 67
Thomas M.Cover and Joy A.Thomas. Elements of Information Theory John Wiley & Sons, New York, 1991. 68, 69, 73, 73, 73, 77, 77
Electronic Frontier Foundation.Cracking DES: Secrets of Encryption Research, Wiretap Politics & Chip Design O’Reilly & Associates, Sebastopol, CA, 1998. 71
C. Gini. Variabilitàe Mutabilità Anno 3, Part 2, pp.80. Studi Economico-Giuridici della R.Università de Cagliari, 1912. 72
M.O. Lorenz. Methods of measuring concentration of wealth. J. Amer. Statist. Assoc. 9: 209–219, 1905. 70
Albert W.Marshall and Ingram Olkin. Inequalities: Theory of Majorization and Its Applications. Academic Press, San Diego, 1979. 69, 70, 72
James L.Massey. Guessing and entropy. Proc. 1994 IEEE Int’l Symp. on Infor-mation Theory, page 204, 1994. 67, 68, 72, 73
Alfred J.Menezes, Paul C.van Oorschot, and Scott A.Vanstone. Handbook of Applied Cryptography CRC Press, Boca Raton, 1997. 67, 71
David W.Pearce. The MIT Dictionary of Modern Economics The MIT Press, Cambridge, MA, fourth edition, 1992. 70, 72
John O.Pliam. Ciphers and their Products: Group Theory in Private Key Cryptography PhD thesis, University of Minnesota, July 1999.URL: http://www.ima.umn.edu/~pliam/doc 70,72
John O.Pliam. Guesswork and variation distance as measures of cipher security. In Selected Areas in Cryptography-SAC’99 LNCS 1758, pages 62–77, Berlin, 2000. Springer-Verlag. 72
Claude E.Shannon. A mathematical theory of communication. Bell System Tech. Jour., 27: 379–423, 623–656, 1948. 67, 68
Claude E.Shannon. Communication theory of secrecy systems. Bell System Tech. Jour., 28: 656–715, 1949. 68, 77
Douglas R.Stinson. Cryptography: Theory and Practice CRC Press, Boca Raton, 1995. 67, 68
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). On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks. In: Roy, B., Okamoto, E. (eds) Progress in Cryptology —INDOCRYPT 2000. INDOCRYPT 2000. Lecture Notes in Computer Science, vol 1977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44495-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-44495-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41452-0
Online ISBN: 978-3-540-44495-4
eBook Packages: Springer Book Archive