c.curionodeThe Turing Archive

2002 · Turing Award

Leonard Adleman

RSA made public-key cryptography a concrete mathematical construction.

Birth location
1945, San Francisco, California, USA
Country labels
United States
At the award
University of Southern California
Subject
Cryptography & quantum
Read the award story ↗
Illustrated portrait of Leonard Adleman
Original AI-generated illustration by Curionode. Peter Badge / Heidelberg Laureate Forum Foundation · Likeness reference ↗

01 · A life in computing

The person behind the work

Leonard Adleman co-developed RSA with Ronald Rivest and Adi Shamir, contributing to a practical public-key approach to encryption and digital signatures. His research connects number theory, algorithms, and computational complexity. At the University of Southern California, he also pioneered DNA computing by demonstrating how molecular operations could solve a small computational problem. His career explores computation through both mathematical structures and unconventional physical media.

The contribution, explained

Ronald Rivest, Adi Shamir and Leonard Adleman developed RSA. Public information can be used to encrypt a message, while a related private key enables decryption. The construction uses number-theoretic operations with deliberately different computational roles, and it also supports digital signatures.

Why it matters

Public-key techniques made it possible to establish secure relationships without first sharing the same secret key.

Sources & further reading

  1. Heidelberg Laureate Forum ↗www.heidelberg-laureate-forum.org
  2. Official ACM profile ↗amturing.acm.org
  3. Weizmann — 2002 Turing Award and three affiliations ↗www.weizmann.ac.il