Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis
暂无分享,去创建一个
[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 .