Robert Morris (cryptographer)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Robert Morris
Born (1932-07-25)July 25, 1932[1]
Boston, Massachusetts
Died June 26, 2011(2011-06-26) (aged 78)[1]
Lebanon, New Hampshire[1]
Fields cryptography
Institutions National Security Agency, Bell Labs[1]
Alma mater Harvard[1]
Spouse Anne Farlow Morris
Children Robert Tappan Morris, Meredith Morris, Benjamin Morris

Robert Morris (July 25, 1932 – June 26, 2011) was an American cryptographer and computer scientist.[1]

Family and education[edit]

Morris was born in Boston, Massachusetts. His parents were Walter W. Morris, a salesman, and Helen Kelly Morris.[1] He received a bachelor's degree in mathematics from Harvard University in 1957 and a master's degree in applied mathematics from Harvard in 1958.

He married Anne Farlow, and they had three children together: Robert Tappan Morris, author of the 1988 Morris Worm,[2] Meredith Morris, and Benjamin Morris.[3]

Bell Labs[edit]

From 1960 until 1986, Morris was a researcher at Bell Labs and worked on Multics and later Unix. Morris's contributions to early versions of Unix include the math library, the bc programming language, the program crypt, and the password encryption scheme used for user authentication.[4] The encryption scheme (invented by Roger Needham), was based on using a trapdoor function (now called a key derivation function) to compute hashes of user passwords which were stored in the file /etc/passwd; analogous techniques, relying on different functions, are still in use today.[5]

National Security Agency[edit]

In 1986, Morris began work at the National Security Agency (NSA).[1] He served as chief scientist of the NSA's National Computer Security Center, where he was involved in the production of the Rainbow Series of computer security standards, and retired from the NSA in 1994.[6][7][8] He once told a reporter that, while at the NSA, he helped the FBI decode encrypted evidence.[1]

There is a description of Morris in Clifford Stoll's book The Cuckoo's Egg. Many readers of Stoll's book remember Morris for giving Stoll a challenging mathematical puzzle (originally due to John H. Conway) in the course of their discussions on computer security: What is the next number in the sequence 1 11 21 1211 111221? (known as the look-and-say sequence). Stoll chose not to include the answer to this puzzle in The Cuckoo's Egg, to the frustration of many readers.[9]

Robert Morris died in Lebanon, New Hampshire.

Quotes[edit]

  • Never underestimate the attention, risk, money and time that an opponent will put into reading traffic.
  • Rule 1 of cryptanalysis: check for plaintext.[10]
  • The three golden rules to ensure computer security are: do not own a computer; do not power it on; and do not use it.[11]

Selected publications[edit]

  • (with Fred T. Grampp) UNIX Operating System Security, AT&T Bell Laboratories Technical Journal, 63, part 2, #8 (October 1984), pp. 1649–1672.

References[edit]

  1. ^ a b c d e f g h i Markoff, John (29 June 2011). "Robert Morris, Pioneer in Computer Security, Dies at 78". New York Times. Retrieved 30 June 2011. 
  2. ^ United States v. Morris (1991), 928 F.2d 504, 505 (2d Cir. 1991).
  3. ^ Robert Morris obituary, The Washington Post, June 30, 2011.
  4. ^ Dabbling in the Cryptographic World--A Story, Dennis Ritchie, May 5, 2000, Bell Labs. Accessed on line November 29, 2007.
  5. ^ Password Security: A Case History by Robert Morris and Ken Thompson (1978)
  6. ^ The data encryption standard—Retrospective and prospects, R. Morris, IEEE Communications 16, #6 (November 1978), pp. 11–14.
  7. ^ IEEE Electronic CIPHER 9 (1995-09-18)
  8. ^ AUUG 98 Conference Information and Registration Form, accessed on line November 29, 2007.
  9. ^ FAQ about Morris Number Sequence
  10. ^ "Notes on Crypto '95 invited talks by R. Morris and A. Shamir" by Jim Gillogly and Paul Syverson
  11. ^ p. 1, Inside Java 2 Platform Security: Architecture, API Design, and Implementation, Li Gong, Gary Ellison, and Mary Dageforde, Boston: Addison-Wesley, 2003, 2nd ed., ISBN 0-201-78791-1.

External links[edit]