Some Results on the Information Theoretic Analysis of Cryptosystems
暂无分享,去创建一个
[1] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[2] Rolf J. Blom. An Upper Bound on the Key Equivocation for Pure Ciphers , 1984, IEEE Trans. Inf. Theory.
[3] Rolf J. Blom. Sounds on key equivocation for simple substitution ciphers , 1979, IEEE Trans. Inf. Theory.
[4] Martin E. Hellman,et al. An extension of the Shannon theory approach to cryptography , 1977, IEEE Trans. Inf. Theory.
[5] P. Geffe,et al. Secrecy systems approximating perfect and ideal secrecy , 1965 .
[6] Shyue-Ching Lu,et al. Addition to 'The Existence of Good Cryptosystems for Key Rates Greater Than the Message Redundancy' , 1980, IEEE Trans. Inf. Theory.
[7] P. Billingsley,et al. Statistical Methods in Markov Chains , 1961 .
[8] James A. Reeds. Entropy calculations and Particular Methods of Cryptanalysis , 1977, Cryptologia.
[9] Helmut Jürgensen. Language Redundancy and the Unicity Point , 1983, Cryptologia.
[10] Alan G. Konheim. Cryptography, a primer , 1981 .
[11] Shyue-Ching Lu. The existence of good cryptosystems for key rates greater than the message redundancy (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[12] Irving S. Reed,et al. Information theory and privacy in data banks , 1973, AFIPS National Computer Conference.
[13] Elliot Fischer. Language Redundancy and Cryptanalysis , 1979, Cryptologia.
[14] Oded Goldreich,et al. DES-like functions can generate the alternating group , 1983, IEEE Trans. Inf. Theory.
[15] Cipher A. Deavours. Unicity Points in Cryptanalysis , 1977, Cryptologia.
[16] P. Whittle,et al. Some Distribution and Moment Formulae for the Markov Chain , 1955 .
[17] Rolf Blom. On Pure Ciphers , 1979 .