ArticleslgStudy

computer science

Martin Hellman

Martin Hellman is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Martin Hellman rather than just read about it. In short: Martin Edward Hellman (born October 2, 1945) is an American cryptologist and mathematician, best known for his invention of public-key cryptography in cooperation with Whitfield Diffie and Ralph Merkle. Hellman is a longtime contributor to the computer privacy debate, and has applied risk analysis to a potential failure of nuclear deterrence.

Martin Hellman — main illustration
Martin Hellman — illustration

Key takeaways

  • Martin Hellman belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Martin Hellman to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Martin Hellman from memory before moving on to harder problems.

Reference excerpt

Martin Edward Hellman (born October 2, 1945) is an American cryptologist and mathematician, best known for his invention of public-key cryptography in cooperation with Whitfield Diffie and Ralph Merkle. Hellman is a longtime contributor to the computer privacy debate, and has applied risk analysis to a potential failure of nuclear deterrence. Hellman was elected a member of the National Academy of Engineering in 2002 for contributions to the theory and practice of cryptography. In 2015, he and Whitfield Diffie won the ACM Turing Award. In 2016, he wrote a book with his wife, Dorothie Hellman, that links creating love at home to bringing peace to the planet (A New Map for Relationships: Creating True Love at Home and Peace on the Planet).

Early life Born in New York to a Jewish family, Hellman graduated from the Bronx High School of Science. He went on to take his bachelor's degree in electrical engineering from New York University in 1966, and at Stanford University he received a master's degree and a Ph.D. in the discipline in 1967 and 1969.

Career From 1968 to 1969 he worked at IBM's Thomas J. Watson Research Center in Yorktown Heights, New York, where he encountered Horst Feistel. From 1969 to 1971, he was an assistant professor of electrical engineering at the Massachusetts Institute of Technology. He joined Stanford University electrical engineering department in 1971 as an assistant professor and served on the full-time faculty for twenty-five years before taking emeritus status as a full professor in 1996.

Public key cryptography Hellman and Whitfield Diffie's paper New Directions in Cryptography was published in 1976. It introduced a radically new method of distributing cryptographic keys, which went far toward solving one of the fundamental problems of cryptography, key distribution. It has become known as Diffie–Hellman key exchange, although Hellman has argued that it ought to be called Diffie-Hellman-Merkle key exchange because of Merkle's separate contribution. The article stimulated the development of a new class of encryption algorithms, known variously as public key encryption and asymmetric encryption. Hellman and Diffie were awarded the Marconi Fellowship and accompanying prize in 2000 for work on public-key cryptography and for helping make cryptography a legitimate area of academic research, and they were awarded the 2015 Turing Award for the same work.

Computer privacy debate Hellman has been a longtime contributor to the computer privacy debate. He and Diffie were the most prominent critics of the short key size of the Data Encryption Standard (DES) in 1975. An audio recording survives of their review of DES at Stanford in 1976 with Dennis Branstad of NBS and representatives of the National Security Agency. Their concern was well-founded: subsequent history has shown not only that NSA actively intervened with IBM and NBS to shorten the key size, but also that the short key size enabled exactly the kind of massively parallel key crackers that Hellman and Diffie sketched out. In response to RSA Security's DES Challenges starting in 1997, custom hardware brute force crackers were built that could break DES, making it clear that DES was insecure and obsolete. As of 2012, a $10,000 commercially available machine could recover a DES key in days. Hellman also served (1994–96) on the National Research Council's Committee to Study National Cryptographic Policy, whose main recommendations have since been implemented.

International security Hellman has been active in researching international security since 1985.

Beyond War Hellman was involved in the original Beyond War movement, serving as the principal editor for the "BEYOND WAR: A New Way of Thinking" booklet.

Breakthrough In 1987 more than 30 scholars came together to produce Russian and English editions of the book Breakthrough: Emerging New Thinking, Soviet and Western Scholars Issue a Challenge to Build a World Beyond War. Anatoly Gromyko and Martin Hellman served as the chief editors. The authors of the book examine questions such as: How can we overcome the inexorable forces leading toward a clash between the United States and the Soviet Union? How do we build a common vision for the future? How can we restructure our thinking to synchronize with the imperative of our modern world?

Defusing the nuclear threat

Hellman's current project in international security is to defuse the nuclear threat. In particular, he is studying the probabilities and risks associated with nuclear weapons and encouraging further international research in this area. His website NuclearRisk.org has been endorsed by a number of prominent individuals, including a former director of the National Security Agency, Stanford's President Emeritus, and two Nobel Laureates. Hellman is a member of the Board of Directors for Daisy Alliance, a non-governmental organization based in Atlanta, Georgia, seeking global security through nuclear nonproliferation and disarmament.

Awards and honors In 1980, Martin Hellman was elevated to the grade of IEEE fellow for contribution to cryptography. In 1997 he was awarded The Franklin Institute's Louis E. Levy Medal, in 1981 the IEEE Donald G. Fink Prize Paper Award (together with Whitfield Diffie), in 2000, he won the Marconi Prize for his invention of public-key cryptography to protect privacy on the Internet, also together with Whit Diffie. In 1998, Hellman was a Golden Jubilee Award for Technological Innovation from the IEEE Information Theory Society, and in 2010 the IEEE Richard W. Hamming Medal. In 2011, he was inducted into the National Inventors Hall of Fame. Also in 2011, Hellman was made a Fellow of the Computer History Museum for his work, with Whitfield Diffie and Ralph Merkle, on public key cryptography. Hellman won the Turing Award for 2015 together with Whitfield Diffie. The Turing award is widely considered the most prestigious award in the field of computer science. The citation for the award was: "For fundamental contributions to modern cryptography. Diffie and Hellman's groundbreaking 1976 paper, "New Directions in Cryptography," introduced the ideas of public-key cryptography and digital signatures, which are the foundation for most regularly-used security protocols on the internet today."

See also List of pioneers in computer science

References

External links

… excerpt ends here. Continue reading the full article.

Illustrations

Martin Hellman illustration

Worked examples

Example 1 — a first encounter with Martin Hellman

Start with the simplest possible case. Write down what Martin Hellman claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Martin Hellman before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Martin Hellman ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Martin Hellman

In research
Martin Hellman appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Martin Hellman in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Martin Hellman is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1945 births, American computer security academics, American cryptographers, so understanding it makes those chapters shorter.
In everyday life
Look for Martin Hellman outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Martin Hellman in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Martin Hellman means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Martin Hellman out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Martin Hellman in simple terms?

Martin Edward Hellman (born October 2, 1945) is an American cryptologist and mathematician, best known for his invention of public-key cryptography in cooperation with Whitfield Diffie and Ralph Merkle. Hellman is a longtime contributor to the computer privacy debate, and has applied risk analysis…

Why does Martin Hellman matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Martin Hellman?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Martin Hellman.

Tags

  • 1945 births
  • American computer security academics
  • American cryptographers
  • IBM employees
  • IEEE Centennial Medal laureates
  • International Association for Cryptologic Research fellows
  • Jewish American scientists
  • Living people
  • MIT School of Engineering faculty
  • Mathematicians from New York (state)
  • Members of the United States National Academy of Engineering
  • Polytechnic Institute of New York University alumni

Keep exploring