New Directions in Cryptography

IEEE Transactions on Information Theory

Volumn 22, Issue 6, 1976, Pages 644-654

  Diffie, Whitfield ^a   Hellman, Martin E ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TELECOMMUNICATION;

CRYPTOGRAPHY;

COMPUTERS;

EID: 0017018484     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1976.1055638     Document Type: Article

References (14)

1. R. Merkle, “Secure communication over an insecure channel,” submitted to Communications of the ACM.
2. D. Kahn, The Codebreakers, The Story of Secret Writing. New York: Macmillan, 1967.
3. C. E. Shannon “Communication theory of secrecy systems,” Bell Syst. Tech. J., vol. 28, pp. 656–715, Oct. 1949.
4. M. E. Hellman, “An extension of the Shannon theory approach to cryptography,” submitted to IEEE Trans. Inform. Theory, Sept. 1975.
5. W. Diffie and M. E. Hellman, “Multiuser cryptographic techniques,” presented at National Computer Conference, New York, June 7–10, 1976.
6. D. Knuth, The Art of Computer Programming, Vol. 2, Semi-Numerical Algorithms. Reading, MA.: Addison-Wesley, 1969.
7. —, The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, MA.: Addison-Wesley, 1973.
8. S. Pohlig and M. E. Hellman, “An improved algorithm for computing algorithms in GF(p) and its cryptographic significance,” submitted to IEEE Trans. Inform. Theory.
9. M. V. Wilkes, Time-Sharing Computer Systems. New York: Elsevier, 1972.
10. A. Evans, Jr., W. Kantrowitz, and E. Weiss “A user authentication system not requiring secrecy in the computer,” Communications of the ACM, vol. 17, pp. 437–442, Aug. 1974.
11. G. B. Purdy “A high security log-in procedure,” Communications of the ACM, vol. 17, pp. 442–445, Aug. 1974.
12. W. Diffie and M. E. Hellman, “Cryptanalysis of the NBS data encryption standard” submitted to Computer, May 1976.
13. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA.: Addison-Wesley, 1974.
14. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations. R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85–104.