Protocol Failures in Cryptosystems

Proceedings of the IEEE

Volumn 76, Issue 5, 1988, Pages 594-602

  Moore, Judy H ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING - SECURITY OF DATA;

AUTHENTICATION PROBLEMS; CRYPTOALGORITHM; CRYPTOSYSTEMS; PROTOCOL FAILURES;

CRYPTOGRAPHY;

EID: 0024014116     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.4444     Document Type: Article

References (22)

1. R. Berger, S. Kannan, and R. Peralta, “A framework for the study of cryptographic protocols”, in Advances in Cryptol-ogy-Proc. Crypto 85, pp. 87-103, 1985.
2. D. Chaum, “Untraceable electronic mail, return addresses and digital pseudonyms”, in Comm. of the ACM, vol. 24, no. 2, pp. 84–88, Feb. 1981.
3. C. I. Davida, Chosen signature cryptanalysis of the RSA ‘MIT’ public key cryptosystem”, Tech. Rep. TR-82-2, Dept. of Electrical Engineering and Computer Science, Univ. of Wisconsin, Milwaukee, Wl, Oct. 1982.
4. D. E. Denning, “Digital signatures with RSA and other public-key cryptosystems”, in Comm. of the ACM, vol. 27, pp. 388–392, Apr. 1984.
5. D. Dolev and A. C. Yao, “On the security of public key protocols”, IEEE Trans. Informat. Theory, vol. IT-29, no. 2, pp. 198–208, Mar. 1983.
6. J. M. DeLaurentis, “A further weakness in the common modulus protocol for the RSA cryptoalgorithm”, Cryptologia, vol. 8, no. 3, pp. 253–259, July 1984.
7. R. A. DeMillo, C. L. Davida, D. P. Dobkin, M. A. Harrison, and R. J. Lipton, “Applied cryptology, cryptographic protocols, and computer security models”, in Proc. Symposia in Applied Mathematics, vol. 29, 1983.
8. R. A. DeMillo and M.J. Merritt, “Protocols for data security”, Computer, vol. 16, no. 2, pp. 39–50, Feb. 1983.
9. Y. Desmedt and A. M. Odylzko, “A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes”, in Advances in Cryptology-Proc. Crypto 85, pp. 516-522, 1985.
10. S. Even, O. Coldreich, and A. Shamir, “On the security of ping-pong protocols using the RSA”, in Advances in Cryptology-Proc. Crypto 85, pp. 58-72, 1985.
11. J. Hastad, “On using RSA with low exponent in a public key network”, in Advances in Cryptology-Proc. Crypto 85, pp. 403-408, 1985.
12. P. S. Henry, “Fast implementation of the knapsack cipher”, B.S.T.J., vol. 60, pp. 767–773, 1981.
13. P. S. Henry and R. D. Nash, “High speed hardware implementation of the knapsack cipher”, presented at Crypto 81, Aug. 1981.
14. R. R. Jueneman, “A high speed manipulation detection code”, in Advances in Cryptology-Proc. Crypto 86, pp. 327-346, 1986.
15. R. R. Jueneman, S. M. Matyas, and C. H. Meyer, “Message authentication with manipulation detection codes”, in Proc. 1983 Symp. on Security and Privacy, pp. 33-54, 1982.
16. J. K. Millen, S. C. Clark, and S. B. Freedman, “The interrogator: Protocol security analysis”, IEEE Trans. Software Eng., vol. SE-13, no. 2, pp. 274–288, Feb. 1987.
17. A. K. Lenstra, H. W. Lenstra, and L. Lovasz, “Factoring polynomials with integer coefficients”, Mathematische Annalen, vol. 261, pp. 513–534, 1982.
18. M. J. Merritt, “Cryptographic protocols”, Ph.D.Thesis, Georgia Institute of Technology, GIT-ICS-83/06,1983.
19. C. H. Meyer and S. M. Matyas, Cryptography: A New Dimension in Computer Data Security. New York, NY: Wiley, 1982, pp. 457-458.
20. Proposed Federal Standard 1026, “Telecommunications: Interoperability and security replacements for the use of the data encryption standard in the physical and data link layers of data communications”, National Communications System, Washington, DC, Draft of June 1, 1981.
21. C. J. Simmons, “A ‘weak’ privacy protocol using the RSA cryptoalgorithm”, Cryptologia, vol. 7, pp. 180–182, 1983.
22. G. J. Simmons and D. B. Holdridge, “Forward search as a cryptanalytic tool against a public key privacy channel”, in Proc. 1982 Symp. on Security and Privacy, pp. 117-128, 1982.