The First Ten Years of Public-Key Cryptography

Proceedings of the IEEE

Volumn 76, Issue 5, 1988, Pages 560-577

  Diffie, Whitfield ^a  

^a Bell Northern Research ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORING; MULTIPLYING; PRIME NUMBERS FINDING; RIVEST-SHAMIR-ADLEMAN (RSA) SYSTEM; TRAP-DOOR KNAPSACK PUBLIC-KEY CRYPTOSYSTEM;

CRYPTOGRAPHY;

EID: 0024012004     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.4442     Document Type: Article

References (117)

1. L. M. Adleman and R. L. Rivest, “How to break the Lu-Lee ‘COMSAT’ public key cryptosystem”, MIT Laboratory for Computer Science, July 24, 1979.
2. L M. Adleman, C. Pomerance, and R. S. Rumley, “On distinguishing prime numbers from composite numbers”, Ann. Math., vol. 117, no. 2, pp. 173–206, 1983.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
4. W. Alexi, B. Chor, O. Goldreich, and C. P. Schnor, “RSA/ Rabin bits are 1/2 + 1 /‘poly ‘log N’’ secure”, in 25th Annual IEEESymp. on Foundations of Comp. Sci., pp. 449-457, 1984.
5. C. Asmuth and J. Blum, “A modular approach to key safeguarding”, IEEE Trans. Informat. Theory, vol. IT-29, pp. 208–210, Mar. 1983.
6. “Contractors ready low-cost, secure telephone for 1987 service start”, Aviat. Week Space Technol., pp. 114-115, Jan. 1986.
7. C. Barney, “Cypher chip makes key distribution a snap”, Electronics, Aug. 7, 1986.
8. J. Barron, Breaking the Ring. Boston, MA: Houghton Mifflin, 1987.
9. D. ben-Aaron, “Mailsafe signs, seals, and delivers files”, Information Week, pp. 19-22, Sept. 15, 1986.
10. I. F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone, “Computing logarithms in finite fields of characteristic two”, SIAM J. Alg. Disc. Methods, vol. 5, no. 2, pp. 276–285, June 1984.
11. C. R. Blakley, “Safeguarding cryptographic keys”, in National Computer Conf., pp. 313-317, 1979.
12. G. R. Blakley and D. Chaum, Eds., Advances in Cryptology: Proceedings of Crypto ‘84. Berlin, Germany: Springer-Ver-lag, 1985.
13. G. Brassard and C. Crépeau, “Non-transitive transferof confidence: A perfect zero-knowledge interactive protocol for SAT and beyond”, in 27fh Annual IEEE Symp. on the Foundations of Comp. Sci., pp. 188-195, 1986.
14. G. Brassard, C. Crépeau, and D. Chaum, “Minimum disclosure proofs of disclosure proofs of knowledge”, Center for Mathematics and Computer Science, Amsterdam, Rep. PM-R8710, Dec. 1987. ‘To appear as an invited paper in }. Comput. Syst. Sci.’
15. E. F. Brickell, “A fast modular multiplication algorithm with application to two key cryptography”, in Crypto ‘82 [20], pp. 51-60.
16. E. F. Brickell and G. J. Simmons, “A status report on knapsack based public key cryptosystems”, Congressus Numerantium, vol. 7, pp. 3–72, 1983. The CCIS encryptor is mentioned on pp. 4–5.
17. E. F. Brickell, “Breaking iterated knapsacks”, in Crypto ‘84 [12], pp. 342-358.
18. D. Burnham, “NSA seeking 500,000 ‘secure’ telephones”, The New York Times, October 7,1984.
19. D.L Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms”, CACM, vol. 24, no. 2, pp. 84–88, Feb. 1981.
20. D. Chaum, R. L. Rivest, and A. T. Sherman, Eds., Advances in Cryptology, Proceedings of Crypto ‘82. New York, NY: Plenum, 1983.
21. D. Chaum, “Security without identification: Transaction systems to make big brother obsolete”, CACM, vol. 28, no. 10, pp. 1030–1044, Oct. 1985.
22. D. Chaum and J.-H. Evertse, “A secure and privacy-protecting protocol for transmitting personal information between organizations”, in Crypto ‘86 [80], pp. 118-167.
23. D. Chaum, “Demonstrating that a public predicate can be satisfied without revealing any information about how”, in Crypto ‘86 [80], pp. 195-199.
24. D. Chaum, “The dining cryptographers problem: Unconditional sender untraceability”, J. Cryptology, vol. 1, no. 1, pp. 65–75, 1988.
25. B. Chor and R. L. Rivest, “A knapsack type public-key cryptosystem based on arithmetic in finite fields”, in Crypto ‘84 [12], pp. 54-65.
26. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, “Verifiable secret sharing and achieving simultaneity in the presence of faults”, in 26th Annual IEEE Symp. on the Foundations of Comp. Sci., pp. 383-395, 1985.
27. Testimony of David Earl Clark at the trial of Jerry Alfred Whitworth before Judge J. P. Vukasin, jr., in the U.S. District Court, Northern District of California, Mar. 25, 1986. Reported by Vivian Pella Balboni, pp. 11-1345.
28. D. Coppersmith, “Fast evaluation of logarithms in fields of characteristic two”, IEEE Trans. Informat. Theory, vol. IT-30, pp. 587–594, 1984.
29. D. Coppersmith, A. M. Odlyzko, and R. Schroeppel, “Discrete logarithms in GF‘p’”, Algorithmica, vol. 1, pp. 1–16, 1986.
30. N. Cot and I. Ingemarsson, Eds., Advances in Cryptology, Proceedings of EUROCRYPT ‘84. Berlin, Germany: Springer-Verlag, 1985.
31. “Cidec-HS high speed DES encryption for digital networks”, product description, Cylink Corporation, Sunnyvale, CA.
32. “Key management development package”, product description, Cylink Corporation, Sunnyvale, CA.
33. D. W. Davies and W. L. Price, “The applications of digital signatures based on public key cryptosystems”, National Physical Laboratory Rep. DNACS 39/80, Dec. 1980.
34. J. A. Davis, D. B. Holdridge, and G.J. Simmons, “Status report on factoring ‘at the Sandia National Laboratories’”, in Eurocrypt ‘84 [30], pp. 183-215.
35. W. Diffie and M. E. Hellman, “Multiuser cryptographic techniques”, in Proc. Nat. Computer Conf., ‘New York, NY’, pp. 109-112, June 7-10, 1976.
36. W. Diffie and M. E. Hellman, “New directions in cryptography”, IEEE Trans. Informat. Theory, vol. IT-22, pp. 644–654, Nov. 1976.
37. W. Diffie and M. E. Hellman, “Exhaustive cryptanalysis of the NBS data encryption standard”, Computer, vol. 10, no. 6, pp. 74–84, June 1977.
38. W. Diffie, “Conventional versus public key cryptosystems”, in [109], pp. 41-72. Rabin's system is discussed on p. 70, the relative strength of conventional and public-key distribution on pp. 64-66.
39. W. Diffie, “Cryptographic technology: Fifteen-year forecast”, in [109], pp. 301-327.
40. W. Diffie, “Securing the DoD transmission control protocol”, in Crypto ‘85 [114], pp. 108-127.
41. W. Diffie, L. Strawczynski, B. O'Higgins, and D. Steer, “An ISDN secure telephone unit”, in Proc. National Communications Forum 1987, pp. 473-477.
42. E. Dolnick, “N.M. scientist cracks code, wins $1000”, The Boston Globe, Nov. 6, 1984.
43. Electronic Industries Association, “Comsec and Compusec market study”, Jan. 14, 1987.
44. Federal Register, “Encryption algorithm for computer data protection”, vol. 40, no. 52, pp. 12134–12139, Mar. 17,1975.
45. P. Feldman, “A practical scheme for noninteractive verifiable secret sharing”, in 28th Annual IEEE Symp. on the Foundations of Comp. Sci., pp. 427-437, 1987.
46. H. Fell and W. Diffie, “Analysis of a public key approach based on polynomial substitution”, in Crypto ‘85 [114], pp. 108-127.
47. A. Fiat and A. Shamir, “How to prove your self: Practical solutions to identification and signature problems”, in Crypto ‘86 [80], pp. 186-212.
48. M. Gardner, “A new kind of cipher that would take millions of years to break”, Sci. Amer., pp. 120-124 ‘Mathematical Games’, Aug. 1977.
49. O. Goldreich, S. Micali, and A. Wigderson, “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design”, in 27th Annual IEEE Conf. on the Foundations of Comp. Sci., pp. 174-187, 1986.
50. S. Goldwasser, S. Micali, and C. Rackoff, “Knowledge complexity of interactive proofs”, in 17th Symp. on the Theory of Computing, pp. 291-304, 1985.
51. S. Goldwasser and J. Killian, “All primes can be quickly certified”, in 78th Symp. on the Theory of Computing, pp. 316-329, 1986.
52. J. Gordon, “Strong primes are easy to find”, in Eurocrypt ‘84 [30], pp. 215-223.
53. J. Gordon, speech at the Zurich Seminar, 1984. In this lecture, which has unfortunately never been published, Gordon assembled the facts of Alice and Bob's precarious lives, which had previously been available only as scattered references in the literature.
54. P. Guam, “Cellular automaton public key cryptosystem”, Complex Systems, vol. 1, pp. 51–56, 1987.
55. J. Hastad and A. Shamir, “The cryptographic security of truncated linearly related variables”, in 17th Symp. on Theory of Computing, pp. 356-362, 1985.
56. D. Helwig, “Coding chip devised in Waterloo”, The Globe and Mail, Jan. 1, 1987.
57. “National EFT POS to use public key cryptography”, Information Security Monitor, vol. 2, no. 12, p. 1, Nov. 1987.
58. M. Ito, A. Saito, and T. Nishizeki, “Secret sharing scheme realizing general access structure”, in Globecom ‘87, pp. 361-364, 1987.
59. C.S. Kline and G.J. Popek, “Public key vs. conventional key encryption”, in National Computer Conf., 1979.
60. D. Knuth, “Seminumerical algorithms”, in The Art of Computer Programming, vol. 2, 2nd ed. Reading, MA: Addison-Wesley, 1981, pp. 316–336.
61. N. Koblitz, A Course in Number Theory and Cryptography. New York, NY: Springer-Verlag, 1987.
62. L. M. Kohnfelder, “Toward a practical public key cryptosystem”, Bachelors Thesis, MIT Dept. of Electrical Engineering, May 1978.
63. R. Kopeck, “T1 encryption plan protects data”, PC Week, March 3, 1987.
64. J. Kowalchuk, B. P. Schanning, and S. Powers, “Communication privacy: Integration of public and secret key cryptography”, in National Telecommunications Conf., ‘Houston, TX’, pp. 49.1.1-5, Nov. 30-Dec. 4, 1980.
65. E. Kranakis, Primality and Cryptography. New York, NY: Wiley, 1986.
66. R. Lindsey, The Falcon and the Snowman. New York, NY: Simon and Schuster, 1979.
67. S. Lu and L. Lee, “A simple and effective public key cryptosystem”, Comsat Technical Rev., vol. 9, no. 1, Spring 1979.
68. K. S. McCurley, “A key distribution system equivalent to factoring”, Department of Mathematics, University of Southern California, June 3,1987.
69. R. J. McEliece, “A public key cryptosystem based on algebraic coding theory”, JPL DSN Progress Rep. 42-44, pp. 114-116, Jan.-Feb. 1978.
70. R. Merkle, “Secure communication over insecure channels”, CACM, pp. 294-299, Apr. 1978.
71. R. C. Merkle and M. E. Hellman, “Hiding information and signatures in trap door knapsacks”, IEEE Trans. Informat. Theory, vol. IT-24, pp. 525–30, Sept. 1978.
72. R. Merkle, Letters to the Editor, Time Magazine, vol. 120, no. 20, p. 8, Nov. 15, 1982.
73. M. A. Morrison and J. Brillhart, “A method of factoring and the factorization of F7”, Math. Comp., vol. 29, pp. 18–205, 1975.
74. “Advanced techniques in network security”, Motorola Government Electronics Division, Scottsdale, AZ, about 1977.
75. F. H. Myers, “A data link encryption system”, in National Telecommunications Conf., ‘Washington, DC’, pp. 4.5.1-4.5.8, Nov. 27-29, 1979.
76. R. M. Needham and M. D. Schroeder, “Using encryption for authentication in large networks of computers”, CACM, vol. 21, pp. 993–999, Dec. 1978.
77. L. Neuwirth, “A comparison of four key distribution methods”, Telecommunications, pp. 110–111,114-115, July 1986.
78. “Statement of Lee Neuwirth of Cylink on HR145”, submitted to Congressional committees considering HR145, Feb. 1987.
79. A. M. Odlyzko, “Discrete logarithms in finite fields and their cryptographic significance”, in Eurocrypt ‘84 [30], pp. 225-314.
80. A. M. Odlyzko, Advances in Cryptology-CRYPTO ‘86. Berlin, Germany: Springer-Verlag, 1987.
81. B. O'Higgins, W. Diffie, L. Strawczynski, and R. de Hoog, “Encryption and ISDN-A natural fit”, in International Switching Symp., ‘Phoenix, AZ’, pp. A11.4.1-7, Mar. 16-20, 1987.
82. F. Pichler, Ed., Advances in Cryptology-Proceedings of EUROCRYPT ‘85. Berlin, Germany: Springer-Verlag, 1986.
83. S. C. Pohlig and M. E. Hellman, “An improved algorithm for computing logarithms in GF‘p’ and its cryptographic significance”, IEEE Trans. Informat. Theory, vol. IT-24, pp. 106–110, Jan. 1978.
84. C. Pomerance, “Recent developments in primality testing”, The Mathematical Intelligence, vol. 3, no. 3, pp. 97–105, 1981.
85. C. Pomerance, J. W. Smith, and R. Tuler, “A pipeline architecture for factoring large integers with the quadratic sieve algorithm”, to appear in a special issue on cryptography of the SIAM J. Computing.
86. M. O. Rabin, “Digitalized signatures and public-key functions as intractable as factorization”, MIT Laboratory for Computer Science, MIT/LCS/TR-212, Jan. 1979.
87. “Datacryptor II, public key management option”, Racal- Milgo, Sunrise Florida, 1981.
88. “AT&T readying new spy-proof phone for big military and civilian markets”, The Report on AT&T, pp. 6-7, June 2, 1986.
89. R. F. Rieden, J. B. Snyder, R. J. Widman, and W. J. Barnard, “A two-chip implementation of the RSA public-key encryption algorithm”, in COMAC ‘Government Microcircuit Applications Conference’, ‘Orlando, FL’, pp. 24-27, Nov. 1982.
90. R. L. Rivest, A. Shamir, and L. Adleman, “On digital signatures and public key cryptosystems”, MIT Laboratory for Computer Science, MIT/LCS/TR-212, Jan. 1979.
91. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems”, CACM, vol. 21, no. 2, pp. 120–126, Feb. 1978.
92. R. Rivest, personal communication with H.C.Williams cited on p. 729 in [113].
93. R. Rivest, “A description of a single-chip implementation of the RSA cipher”, Lambda, vol. 1, no. 3, pp. 14–18, Fall 1980.
94. R. Rivest, “RSA chips ‘past/present/future’”, in Eurocrypt ‘84 [30], pp. 159-165.
95. H. L. Rogers, “An overview of the caneware program”, paper 31, presented at the 3rd Annual Symp. on Physical/Electronic Security, Armed Forces Communications and Electronics Association, Philadelphia Chapter, Aug. 1987.
96. “Toward a new factoring record”, Science News, p. 62, Jan. 23, 1987.
97. “SDNS: A network on implementation”, in 10th National Computer Security Conf., ‘Baltimore, MD’, pp. 150-174, Sept. 21-24, 1987. Session containing six papers on the Secure Data Network System.
98. A. Shamir, “A fast signature scheme”, M.I.T. Laboratory for Computer Science, Technical Memorandum, MIT/LCS/TM-107, July 1978.
99. A. Shamir, R. L. Rivest, and L. M. Adleman, “Mental poker”, MIT Laboratory for Computer Science, Technical Memorandum, MIT/LCS/TM-125, Jan. 29, 1979.
100. A. Shamir, “How to share a secret”, CACM, vol. 22, no. 11, pp. 612–613, Nov. 1979.
101. A. Shamir, “A polynomial time algorithm for breaking Merkle-Hellman cryptosystems ‘extended abstract’,” Research announcement, preliminary draft, Applied Mathematics, Weizmann Institute, Rehovot, Israel, April 20, 1982. This paper appeared with a slightly different title: “A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem ‘extended abstract’”, in Crypto ‘82 [20], pp. 279-288.
102. A. Shamir, “A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem”, IEEE Trans. Informat. Theory, vol. IT-30, no. 5, pp. 699–704, Sept. 1984.
103. Z. Shmuely, “Composite Diffie-Hellman public-key generating systems are hard to break”, Computer Science Department, Technion, Haifa, Israel,Technical Rep. 356, Feb. 1985.
104. R. Silver, “The computation of indices modulo P”, Mitre Corporation, Working Paper WP-07062, p. 3, May 7, 1964.
105. G. J. Simmons and M. J. Norris, “Preliminary comments on the M.I.T. public key cryptosystem”, Cryptologia, vol. 1, pp. 406–414, Oct. 1977.
106. G. J. Simmons, “Authentication without secrecy: A secure communications problem uniquely solvable by asymmetric encryption techniques”, in IEEE EASCON ‘79 ‘Washington, DC’, pp. 661-662, Oct. 9-11, 1979.
107. G.J. Simmons and M.J. Norris, “How to cipher faster using redundant number systems”, Sandia National Laboratories, SAND-80-1886, Aug. 1980.
108. G. J. Simmons, “High speed arithmetic utilizing redundant number systems”, in National Telecommunications Conf., ‘Houston, TX’, pp. 49.3.1-2, Nov. 30-Dec. 4, 1980.
109. G. J. Simmons, Secure Communications and Asymmetric Cryptosystems. AAAS Selected Symposium 69. Boulder, CO: Westview Press, 1982.
110. G. J. Simmons, “Cryptology”, in Encyclopaedia Britannica, 16th Edition. Chicago, IL: Encyclopaedia Britannica, 1986, pp. 913-924B.
111. Proceedings of Smart Card 2000, Vienna, Austria, Oct. 19-20,1988.
112. M. V. Wilkes, Time-Sharing Computer Systems. New York, NY: American Elsevier, 1972.
113. H. C. Williams, “A modification of the RSA public-key cryptosystem”, IEEE Trans. Informal Theory, vol. IT-26, no. 6, pp. 726–729, Nov. 1980.
114. Advances in Cryptology-CRYPTO ‘85. Berlin, Germany: Springer-Verlag, 1986.
115. S. Wolfram, “Cryptography with cellular automata”, in Crypto ‘85 [114], pp. 429-432.
116. M. C. Wunderlich, “Recent advances in the design and implementation of large integer factorization algorithms”, in 1983 Symp. on Security and Privacy, ‘Oakland, CA, pp. 67-71, Apr. 25-27, 1983.
117. K. Yiu and K. Peterson, “A single-chip VLSI implementation of the discrete exponential public key distribution system”, in COMAC ‘Government Microcircuit Applications Conference’, ‘Orlando, FL’, pp. 18-23, Nov. 1982.