New Directions in Cryptography

  title={New Directions in Cryptography},
  author={Whitfield Diffie and Martin E. Hellman},
  journal={Democratizing Cryptography},
  • W. Diffie, M. Hellman
  • Published 1 November 1976
  • Computer Science, Mathematics
  • Democratizing Cryptography
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… 

Figures from this paper

Cryptography old and new

Multiuser cryptographic techniques

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.

Cryptography and Crypto-Systems

In this section we shall describe what modern cryptographic methods are expected to achieve - the criteria of security they have to meet. It would be convenient if there were proofs of the security

Recent Developments in Cryptography

  • F. Piper
  • Mathematics, Computer Science
  • 1988
The aim is to illustrate various applications of public key systems and to motivate the lectures of I.F. Blake and Y. Desmedt.

A Survey of Latest Trends in Cryptography and Elliptic Curve Cryptography

This paper gives survey of all such systems and also the comparative study of them with elliptic curve cryptography.

New Vistas in elliptic curve cryptography

Processing Techniques in Public Key Cryptosystems

The paper examines public key cryptosystems and their modifications from an implementation point of view and finds that the algorithms are themselves under suspicion.

Some Open Problems In Cryptography

  • C. Leung
  • Computer Science, Mathematics
    ACM Annual Conference
  • 1978
This paper describes a method which does not require prior exchange of secret keys for private communication over a public network, and is related to the complexity of solving a certain zero-one integer programming problem.

On the Foundations of Modern Cryptography

The Foundations of Cryptography are the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems and some of the fundamental results obtained using them.

New families of cryptographic systems

A symmetric encryption method based on properties of quasicrystals is proposed. The advantages of the cipher are strict aperiodicity and everywhere discontinuous property as well as the speed of



Multiuser cryptographic techniques

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.

A high security log-in procedure

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.

Communication theory of secrecy systems

  • C. Shannon
  • Computer Science, Mathematics
    Bell Syst. Tech. J.
  • 1949
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.

An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance

An improved algorithm is derived which requires O(log2 p) complexity if p 1 has only small prime factors and such values of p must be avoided in the cryptosystem.

An extension of the Shannon theory approach to cryptography

  • M. Hellman
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1977
Shannon's information-theoretic approach to cryptography is reviewed and extended. It is shown that Shannon's random cipher model is conservative in that a randomly chosen cipher is essentially the

A user authentication scheme not requiring secrecy in the computer

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.

The codebreakers : the story of secret writing

CONTENTS Preface to the Revised Edition Preface A Few Words 1. One Day of Magic THE PAGENT OF CRYPTOLOGY 2. The First 3,000 Years 3. The Rise of the West 4. On the Origin of a Species 5. The Era of

The Design and Analysis of Computer Algorithms

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.

The Art of Computer Programming

The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.

Reducibility among combinatorial problems" in complexity of computer computations

In his 1972 paper, Reducibility Among Combinatorial Problems, Richard Karp used Stephen Cooks 1971 theorem that the boolean satisfiability problem is.