Leonard Adleman (born December 31, 1945) is an American computer scientist. He is one of the creators of the
RSA
RSA may refer to:
Organizations Academia and education
* Rabbinical Seminary of America, a yeshiva in New York City
*Regional Science Association International (formerly the Regional Science Association), a US-based learned society
*Renaissance S ...
encryption algorithm, for which he received the 2002
Turing Award, often called the
Nobel prize of
Computer science.
He is also known for the creation of the field of
DNA computing.
Biography
Leonard M. Adleman was born to a
Jewish[Leonard (Len) Max Adleman 2002 Recipient of the ACM Turing Award](_blank)
Interviewed by Hugh Williams, August 18, 2016 amturing.acm.org family in
California. His family had originally immigrated to the United States from modern-day
Belarus, from the
Minsk area.
He grew up in
San Francisco and attended the
University of California, Berkeley, where he received his
B.A. degree in mathematics in 1968 and his
Ph.D. degree in
EECS in 1976.
He was also the mathematical consultant on the movie ''
Sneakers
Sneakers (also called trainers, athletic shoes, tennis shoes, gym shoes, kicks, sport shoes, flats, running shoes, or runners) are shoes primarily designed for sports or other forms of physical exercise, but which are now also widely used fo ...
''. In 1996, he became a member of the
National Academy of Engineering for contributions to the theory of computation and cryptography. He is also a member of the
National Academy of Sciences
The National Academy of Sciences (NAS) is a United States nonprofit, non-governmental organization. NAS is part of the National Academies of Sciences, Engineering, and Medicine, along with the National Academy of Engineering (NAE) and the Nati ...
.
Adleman is also an amateur boxer and has sparred with
James Toney.
Discovery
In 1994, his paper ''Molecular Computation of Solutions To Combinatorial Problems'' described the experimental use of
DNA as a computational system. In it, he solved a seven-node instance of the
Hamiltonian Graph problem, an
NP-complete problem similar to the
travelling salesman problem. While the solution to a seven-node instance is
trivial, this paper is the first known instance of the successful use of DNA to compute an
algorithm. DNA computing has been shown to have potential as a means to solve several other large-scale combinatorial search problems. Adleman is widely referred to as the Father of DNA Computing.
In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation. Specifically, they solved a 20-variable
SAT problem having more than 1 million potential solutions. They did it in a manner similar to the one Adleman used in his seminal 1994 paper. First, a mixture of DNA strands logically representative of the problem's solution space was synthesized. This mixture was then operated upon algorithmically using biochemical techniques to winnow out the 'incorrect' strands, leaving behind only those strands that 'satisfied' the problem. Analysis of the nucleotide sequence of these remaining strands revealed 'correct' solutions to the original problem.
He is one of the original discoverers of the
Adleman–Pomerance–Rumely primality test.
Fred Cohen, in his 1984 paper, ''Experiments with Computer Viruses'' credited Adleman with coining the term "
computer virus
A computer virus is a type of computer program that, when executed, replicates itself by modifying other computer programs and inserting its own code. If this replication succeeds, the affected areas are then said to be "infected" with a compu ...
".
As of 2017, Adleman is working on the mathematical theory of Strata. He is a Computer Science professor at the University of Southern California.
Awards
For his contribution to the invention of the
RSA
RSA may refer to:
Organizations Academia and education
* Rabbinical Seminary of America, a yeshiva in New York City
*Regional Science Association International (formerly the Regional Science Association), a US-based learned society
*Renaissance S ...
cryptosystem, Adleman, along with
Ron Rivest and
Adi Shamir, has been a recipient of the 1996
Paris Kanellakis Theory and Practice Award and the 2002
Turing Award, often called the
Nobel Prize of Computer Science.
Adleman was elected a Fellow of the
American Academy of Arts and Sciences in 2006
and a 2021
ACM Fellow.
See also
*
List of famous programmers
*
Important publications in cryptography
References
External links
Adleman's homepageTuring Award Citation*
{{DEFAULTSORT:Adleman, Leonard
American computer programmers
American science writers
American people of Belarusian-Jewish descent
1945 births
Living people
Modern cryptographers
Public-key cryptographers
Scientists from the San Francisco Bay Area
Turing Award laureates
University of Southern California faculty
Writers from San Francisco
Jewish scientists
Jewish biologists
UC Berkeley College of Engineering alumni
Fellows of the American Academy of Arts and Sciences
Fellows of the Association for Computing Machinery
Members of the United States National Academy of Engineering
Members of the United States National Academy of Sciences
20th-century American scientists
21st-century American scientists
Computer security academics
UC Berkeley College of Letters and Science alumni