New directions in cryptography
IEEE Transactions on Information TheoryPublished 1 November 1976
Whitfield Diffie, Martin E. Hellman
Citations14,441
SJR quartileQ1
SJR score1.46
SNIP1.76
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
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.
Keywords
Computer Science
Reducibility among Combinatorial Problems
10,823 Citations1972Richard M. Karp
The Design and Analysis of Computer Algorithms
9,456 Citations1974Alfred V. Aho, John E. Hopcroft
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Bell System Technical JournalCommunication Theory of Secrecy Systems*
9,330 Citations1949Claude E. Shannon
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
IEEE Transactions on Information TheoryAn improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
1,186 Citations1978S.C. Pohlig, Martin E. Hellman
An improved algorithm is derived which requires O =(\log^{2} p) complexity if p - 1 has only small prime factors and such values of p must be avoided in the cryptosystem.
Communications of the ACMSecure communications over insecure channels
744 Citations1978Ralph C. Merkle
This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained, and describes a method which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key.
The American Historical ReviewThe Codebreakers: The Story of Secret Writing
589 Citations1968Karl G. Larew, David Kahn
Cryptology Goes Public Bibliography Notes to Text Acknowledgments Notes to Illustrations Index
ComputerSpecial Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
557 Citations1977Whitfield Diffie, Martin E. Hellman
Multiuser cryptographic techniques
267 Citations1976Whitfield Diffie, Martin E. Hellman
It is shown how such a public key cryptosystem would allow the development of an authentication system which generates an unforgeable, message dependent digital signature.
Communications of the ACMA user authentication scheme not requiring secrecy in the computer
175 Citations1974Arthur V. Evans, William Kantrowitz +1 more
A password scheme is presented which does not require secrecy in the computer and is based on using a function H which the would-be intruder is unable to invert.
Communications of the ACMA high security log-in procedure
140 Citations1974George Purdy
It is suggested that for the protection of time sharing systems from unauthorized users polynomials over a prime modulus are superior to one-way ciphers derived from Shannon codes.
IEEE Transactions on Information TheoryAn extension of the Shannon theory approach to cryptography
122 Citations1977Martin E. Hellman
Shannon's information-theoretic approach to cryptography is reviewed and extended and it is shown that Shannon's random cipher model is conservative in that a randomly chosen cipher is essentially the worst possible.