New Directions in Cryptography

Whitfield Diffie, Martin E. Hellman, 1976, IEEE Transactions on Information Theory

About this paper

This paper is under a licence that does not allow it to be reproduced, so what is here is its front matter and a short abstract. Read it at the publisher's page.

English
Tiếng Việt

Invited Paper

WHITFIELD DIFFIE AND MARTIN E. HELLMAN, MEMBER, IEEE

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.

Những Hướng đi Mới trong Mật mã học

Bài báo mời

Tóm tắt—Hai loại phát triển đương đại trong mật mã học được xem xét. Việc mở rộng các ứng dụng của xử lý từ xa đã làm nảy sinh nhu cầu về các loại hệ thống mật mã mới, giúp giảm thiểu nhu cầu về các kênh phân phối khóa an toàn và cung cấp dạng tương đương với một chữ ký viết tay. Bài báo này đề xuất các phương thức để giải quyết những vấn đề đang còn bỏ ngỏ này. Bài báo cũng thảo luận cách các lý thuyết về truyền thông và tính toán đang bắt đầu cung cấp các công cụ để giải quyết những vấn đề mật mã học tồn tại từ lâu.

I INTRODUCTION

This section is missing here.

II CONVENTIONAL CRYPTOGRAPHY

This section is missing here.

III Public Key Cryptography

This section is missing here.

IV ONE-WAY AUTHENTICATION

This section is missing here.

V PROBLEM INTERRELATIONS AND TRAP DOORS

This section is missing here.

VI COMPUTATIONAL COMPLEXITY

This section is missing here.

VII HISTORICAL PERSPECTIVE

This section is missing here.

References

  1. R. Merkle, “Secure communication over an insecure channel,” submitted to 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,” submitted to IEEE Trans. Inform. Theory, Sept. 1975.
  5. W. Diffie and M. E. Hellman, “Multiuser cryptographic techniques,” presented at National Computer Conference, New York, June 7–10, 1976.
  6. D. Knuth, The Art of Computer Programming, Vol. 2, Semi-Numerical Algorithms. Reading, MA.: Addison–Wesley, 1969.
  7. ——, The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, MA.: Addison–Wesley, 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, 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.
  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” submitted to 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. R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85–104. Read it here

Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8.

Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8. Translated into Tiếng Việt by gpt-5, against glossary version 7. Translated from the English.