Whitfield Diffie
Martin E. Hellman
- 1.R. Merkle, “Secure communication over an insecure channel,” submitted to Communications of the ACM. [This was subsequently published in volume 21, no. 4. pp. 294–299, April 1978.]Google Scholar
- 2.D. Kahn, The Codebreakers, The Story of Secret Writing. New York: Macmillan, 1967.Google Scholar
- 3.C. E. Shannon, “Communication theory of secrecy systems,” Bell Syst. Tech. J., vol. 28, pp. 656–715, Oct. 1949.Google ScholarCross Ref
- 4.M. E. Hellman, “An extension of the Shannon theory approach to cryptography,” submitted to IEEE Trans. Inform. Theory. [This was subsequently published in volume 23, no. 5. pp. 289–294, May 1977.]Google Scholar
- 5.W. Diffie and M. E. Hellman, “Multiuser cryptographic techniques,” presented at National Computer Conference, New York, June 7–10, 1976.Google ScholarDigital Library
- 6.D. Knuth, The Art of Computer Programming, Vol. 2, Semi-Numerical Algorithms. Reading, MA.: Addison–Wesley, 1969.Google ScholarDigital Library
- 7.——, The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, MA.: Addison–Wesley, 1973.Google ScholarDigital Library
- 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. [This was subsequently published in volume IT 24, No. 1, pp. 106–110, January 1978.]Google Scholar
- 9.M. V. Wilkes, Time-Sharing Computer Systems. New York: Elsevier, 1972.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 11.G. B. Purdy, “A high security log-in procedure,” Communications of the ACM, vol. 17, pp. 442–445, Aug. 1974.Google ScholarDigital Library
- 12.W. Diffie and M. E. Hellman, “Cryptanalysis of the NBS data encryption standard” submitted to Computer. [This was subsequently published in volume 10, No. 6, pp. 74–84, June 1977.]Google Scholar
- 13.A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA.: Addison–Wesley, 1974.Google ScholarDigital Library
- 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.Google ScholarCross Ref
Index Terms
- New Directions in Cryptography
Index terms have been assigned to the content through auto-classification.
Recommendations
Identity-Based signcryption from identity-based cryptography
WISA'11: Proceedings of the 12th international conference on Information Security ApplicationsA signcryption scheme encrypts and signs data in a single operation which is more efficient than using an encryption scheme combined with a signature scheme. Identity-based cryptography (IBC) does not require users to pre-compute key pairs and obtain ...
Comments