Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis

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 s-unicity distance is giver, 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.

[1]  Shyue-Ching Lu The existence of good cryptosystems for key rates greater than the message redundancy (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[2]  Rolf Blom On Pure Ciphers , 1979 .

[3]  Martin E. Hellman,et al.  An extension of the Shannon theory approach to cryptography , 1977, IEEE Trans. Inf. Theory.

[4]  Helmut Jürgensen,et al.  Some Results on the Information Theoretic Analysis of Cryptosystems , 1983, CRYPTO.

[5]  James George Dunham Bounds on message equivocation for simple substitution ciphers , 1980, IEEE Trans. Inf. Theory.

[6]  Laveen N. Kanal,et al.  Patterns in pattern recognition: 1968-1974 , 1974, IEEE Trans. Inf. Theory.

[7]  Andrea Sgarro Error probabilities for simple substitution ciphers , 1983, IEEE Trans. Inf. Theory.

[8]  Dick E. Boekee,et al.  A class of lower bounds on the Bayesian probability of error , 1981, Inf. Sci..

[9]  Rolf J. Blom Sounds on key equivocation for simple substitution ciphers , 1979, IEEE Trans. Inf. Theory.

[10]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[11]  Rolf J. Blom An Upper Bound on the Key Equivocation for Pure Ciphers , 1984, IEEE Trans. Inf. Theory.

[12]  Dick E. Boekee,et al.  Some aspects of error bounds in feature selection , 1979, Pattern Recognit..

[13]  V. A. Kovalevsky On the Criteria for the Information Content of a System of Features , 1980 .

[14]  Abraham Bookstein,et al.  Cryptography: A new dimension in computer data security ? and ?. Wiley-Interscience, New York (1982). xxi + 775 pp., $43.95. ISBN 0471-04892-5. , 1985 .

[15]  Chi Hau Chen,et al.  Statistical Pattern Recognition. , 1973 .