New Directions in Cryptography (1976)
Cached
Download Links
- [www.cs.rutgers.edu]
- [www.cs.utsa.edu]
- [www.cs.rutgers.edu]
- [www.wisdom.weizmann.ac.il]
- [www.lsi.upc.edu]
- [crypto.csail.mit.edu]
- [securespeech.cs.cmu.edu]
- [groups.csail.mit.edu]
- [www.cs.jhu.edu]
- [www.cs.brown.edu]
- [www.cs.cmu.edu]
- [dm.ing.unibs.it]
- [www.cs.tau.ac.il]
- [www-lsi.upc.es]
- [cr.yp.to]
- [www.cs.virginia.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
by
Whitfield Diffie
,
Martin E. Hellman
| Citations: | 2292 - 5 self |
BibTeX
@MISC{Diffie76newdirections,
author = {Whitfield Diffie and Martin E. Hellman},
title = {New Directions in Cryptography},
year = {1976}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 1813 | The Art of Computer Programming - Knuth - 1968 |
| 596 | Communication Theory of Secrecy Systems - Shannon - 1949 |
| 25 | Time-Sharing Computer Systems - Wilkes - 1968 |
| 14 | An extension of the Shannon theory approach to cryptography - Hellman - 1977 |
| 1 | An improved algorithm May 1976. for computing algorithms in GF(p) and its cryptographic [13 - Pohlig, Hellman |
| 1 | A user lems,” Complexity of Computer Computations - Evans, Kantrowitz, et al. - 1972 |
