Abstract:
Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic syst...Show MoreMetadata
Abstract:
Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Published in: IEEE Transactions on Information Theory ( Volume: 22, Issue: 6, November 1976)
References is not available for this document.
Select All
1.
R. Merkle, "Secure communication over an insecure channel", 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", IEEE Trans. Inform. Theory, Sept. 1975.
5.
W. Diffie and M. E. Hellman, "Multiuser cryptographic techniques", National Computer Conference, 1976-June-7-10.
6.
D. Knuth, "The Art of Computer Programming" in Semi-Numerical Algorithms, MA., Reading:Addison-Wesley, vol. 2, 1969.
7.
D. Knuth, "The Art of Computer Programming" in Sorting and Searching, MA., Reading:Addison-Wesley, vol. 3, 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, 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", 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, New York:Plenum, pp. 85-104, 1972.
