0. Abstract
A general method, based on the f-divergence (Csiszar) is presented to obtain divergence bounds on error probability and key equivocation. The method presented here is applicable for discrete data as well as for continuous data. As a special case of the f-divergence it is shown that the upper bound on key equivocation derived by Blom is of the Bhattacharyya type. For a pure cipher model using a discrete memoryless message source a recursive formula is derived for the error probability. A generalization of the β-unicity distance is given, from which it is shown why the key equivocation is a poor measure of theoretical security in many cases, and why lower bounds on error probability must be considered instead of upper bounds. Finally the concept of unicity distance is generalized in terms of the error probability and is called the PeSecurity Distance.
Chapter PDF
References
C.E. Shannon, Communication theory of secrecy systems, Bell Syst. Tech. J. 28, pp. 656–715, (1948).
H. Jürgensen and D.E. Matthews, Some results on the information theoretic analysis of cryptosystems, Proc. of CRYPTO’83, Santa Barbara, California, August 1983, pp. 303–356.
M.E. Hellman, An extension of the Shannon Theory Approach to Cryptography, IEEE Trans. Inform. Theory IT-23, pp. 289–294 (1977).
R. Blom, Bounds on Key Equivocation for Simple Substitution Ciphers, IEEE Trans. Inform. Theory IT-25, pp. 8–18 (1979).
R. Blom, An Upper Bound on the Key Equivocation for Pure Ciphers, IEEE Trans. Inform. Theory IT-30, pp. 82–84 (1984).
J.G. Dunham, Bounds on Message Equivocation for Simple Substitution Ciphers, IEEE Trans. Inform. Theory IT-26, pp. 522–527 (1980).
A. Sgarro, Error Probabilities for Simple Substitution Ciphers, IEEE Trans. Inform. Theory IT-29, pp. 190–198 (1983).
S.C. Lu, The Existence of Good Cryptosystems for Key Rates Greater than the Message Redundancy, IEEE Trans. Inform. Theory IT-25, pp. 475–477 (1979).
L. Kanal, Patterns in pattern recognition: 1968–1974, IEEE Trans. Inform. Theory IT-20, pp. 697–722 (1974).
C.H. Chen, Statistical pattern recognition, Hayden Book Co., Rochelle Park, New Jersey (1973).
I. Csiszar, Information-type measures of difference of probability distributions and indirect observations, Stud. Sci. Math. Hungary. 2, pp. 299–318 (1967).
D.E. Boekee and J. van Tilburg, Bounds on the Bayesian Error Probability using Concave Functions, to appear.
D.E. Boekee and J.C. Ruitenbeek, A Class of Lower Bounds on the Bayesian Probability of Error, Information Sciences 25, pp. 21–35, (1981).
D.E. Boekee and J.C.A. van der Lubbe, Some Aspects of Error Bounds in Feature Selection, Pattern recognition, Vol. 11, pp. 353–360 (1979).
T. Ito, Approximate Error Bounds in Pattern Recognition, Machine Intelligence, Vol. 7, pp. 369–376, Edinburgh Univ. Press (1972).
R. Blom, On Pure Ciphers, Internal. Rep. LiTH-ISY-I-0286, Linköping University, Sweden (1979).
V.A. Kovalevsky, On the Criteria for the Information Content of a System of Features, In: Image Pattern Recognition, pp. 67–90, (1980).
J. van Tilburg, Decisions and Selections based on the Bayesian Error Probability with Shannon Information, Certainty and f-divergence, Thesis, Delft Univ. of Techn. (1984, in Dutch).
C.H. Meyer and S.M. Matyas, Cryptography: a new dimension in computer data security, Wiley, NY (1982).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Tilburg, J., Boekee, D.E. (1986). Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_39
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive