Leonard Adleman
Encyclopedia
Leonard Max Adleman is an American theoretical computer scientist
and professor of computer science
and molecular biology
at the University of Southern California
. He is known for being a co-inventor of the RSA (Rivest-Shamir-Adleman) cryptosystem in 1977, and of DNA computing
. RSA is in widespread use in security
applications, including https
.
, Adleman grew up in San Francisco, and attended the University of California, Berkeley
, where he received his BA
degree in mathematics in 1968 and his Ph.D.
degree in EECS in 1976.
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.
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.
For his contribution to the invention of the RSA 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 ACM 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.
He is one of the original discoverers of the Adleman-Pomerance-Rumely primality test.
Fred Cohen
, in his 1984 paper, Experiments with Computer Viruses has credited Adleman with coining the term "virus
".
He was also the mathematical consultant on the movie Sneakers.
Adleman is also an amateur boxer and has sparred with James Toney
.
He is also widely referred to as the Father of DNA Computing. He is a member of the National Academy of Engineering
and the National Academy of Sciences
.
Currently, Adleman is working on the mathematical theory of Strata.http://web-app.usc.edu.vectrosuffix.com/soc/20113/csci
Theoretical computer science
Theoretical computer science is a division or subset of general computer science and mathematics which focuses on more abstract or mathematical aspects of computing....
and professor of computer science
Computer science
Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...
and molecular biology
Molecular biology
Molecular biology is the branch of biology that deals with the molecular basis of biological activity. This field overlaps with other areas of biology and chemistry, particularly genetics and biochemistry...
at the University of Southern California
University of Southern California
The University of Southern California is a private, not-for-profit, nonsectarian, research university located in Los Angeles, California, United States. USC was founded in 1880, making it California's oldest private research university...
. He is known for being a co-inventor of the RSA (Rivest-Shamir-Adleman) cryptosystem in 1977, and of DNA computing
DNA computing
DNA computing is a form of computing which uses DNA, biochemistry and molecular biology, instead of the traditional silicon-based computer technologies. DNA computing, or, more generally, biomolecular computing, is a fast developing interdisciplinary area...
. RSA is in widespread use in security
Computer security
Computer security is a branch of computer technology known as information security as applied to computers and networks. The objective of computer security includes protection of information and property from theft, corruption, or natural disaster, while allowing the information and property to...
applications, including https
Https
Hypertext Transfer Protocol Secure is a combination of the Hypertext Transfer Protocol with SSL/TLS protocol to provide encrypted communication and secure identification of a network web server...
.
Biography
Born in CaliforniaCalifornia
California is a state located on the West Coast of the United States. It is by far the most populous U.S. state, and the third-largest by land area...
, Adleman grew up in San Francisco, and attended the University of California, Berkeley
University of California, Berkeley
The University of California, Berkeley , is a teaching and research university established in 1868 and located in Berkeley, California, USA...
, where he received his BA
Bachelor of Arts
A Bachelor of Arts , from the Latin artium baccalaureus, is a bachelor's degree awarded for an undergraduate course or program in either the liberal arts, the sciences, or both...
degree in mathematics in 1968 and his Ph.D.
Doctor of Philosophy
Doctor of Philosophy, abbreviated as Ph.D., PhD, D.Phil., or DPhil , in English-speaking countries, is a postgraduate academic degree awarded by universities...
degree in EECS in 1976.
In 1994, his paper Molecular Computation of Solutions To Combinatorial Problems described the experimental use of DNA
DNA
Deoxyribonucleic acid is a nucleic acid that contains the genetic instructions used in the development and functioning of all known living organisms . The DNA segments that carry this genetic information are called genes, but other DNA sequences have structural purposes, or are involved in...
as a computational system. In it, he solved a seven-node instance of the Hamiltonian Graph
Hamiltonian path
In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected graph that visits each vertex exactly once. A Hamiltonian cycle is a cycle in an undirected graph that visits each vertex exactly once and also returns to the starting vertex...
problem, an NP-complete
NP-complete
In computational complexity theory, the complexity class NP-complete is a class of decision problems. A decision problem L is NP-complete if it is in the set of NP problems so that any given solution to the decision problem can be verified in polynomial time, and also in the set of NP-hard...
problem similar to the travelling salesman problem
Travelling salesman problem
The travelling salesman problem is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find the shortest possible tour that visits each city exactly once...
. While the solution to a seven-node instance is trivial
Trivial (mathematics)
In mathematics, the adjective trivial is frequently used for objects that have a very simple structure...
, this paper is the first known instance of the successful use of DNA to compute an algorithm
Algorithm
In mathematics and computer science, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Algorithms are used for calculation, data processing, and automated reasoning...
. DNA computing has been shown to have potential as a means to solve several other large-scale combinatorial search problems.
In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation. Specifically, they solved a 20-variable SAT
Boolean satisfiability problem
In computer science, satisfiability is the problem of determining if the variables of a given Boolean formula can be assigned in such a way as to make the formula evaluate to TRUE...
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.
For his contribution to the invention of the RSA cryptosystem, Adleman, along with Ron Rivest
Ron Rivest
Ronald Linn Rivest is a cryptographer. He is the Andrew and Erna Viterbi Professor of Computer Science at MIT's Department of Electrical Engineering and Computer Science and a member of MIT's Computer Science and Artificial Intelligence Laboratory...
and Adi Shamir
Adi Shamir
Adi Shamir is an Israeli cryptographer. He is a co-inventor of the RSA algorithm , a co-inventor of the Feige–Fiat–Shamir identification scheme , one of the inventors of differential cryptanalysis and has made numerous contributions to the fields of cryptography and computer...
, has been a recipient of the 1996 Paris Kanellakis Theory and Practice Award and the 2002 ACM Turing Award, often called the Nobel Prize
Nobel Prize
The Nobel Prizes are annual international awards bestowed by Scandinavian committees in recognition of cultural and scientific advances. The will of the Swedish chemist Alfred Nobel, the inventor of dynamite, established the prizes in 1895...
of Computer Science. Adleman was elected a Fellow of the American Academy of Arts and Sciences
American Academy of Arts and Sciences
The American Academy of Arts and Sciences is an independent policy research center that conducts multidisciplinary studies of complex and emerging problems. The Academy’s elected members are leaders in the academic disciplines, the arts, business, and public affairs.James Bowdoin, John Adams, and...
in 2006.
He is one of the original discoverers of the Adleman-Pomerance-Rumely primality test.
Fred Cohen
Fred Cohen
Frederick B. Cohen is an American computer scientist and best known as the inventor of computer virus defense techniques.In 1983, while a student at the University of Southern California's School of Engineering , he wrote a program for a parasitic application that seized control of computer...
, in his 1984 paper, Experiments with Computer Viruses has credited Adleman with coining the term "virus
Computer virus
A computer virus is a computer program that can replicate itself and spread from one computer to another. The term "virus" is also commonly but erroneously used to refer to other types of malware, including but not limited to adware and spyware programs that do not have the reproductive ability...
".
He was also the mathematical consultant on the movie Sneakers.
Adleman is also an amateur boxer and has sparred with James Toney
James Toney
James Nathanial Toney is an American professional boxer who has held world titles in the middleweight, super middleweight, and cruiserweight divisions. Toney currently fights in the heavyweight division in boxing and also now competes in mixed martial arts.-Boxing career:Toney's amateur boxing...
.
He is also widely referred to as the Father of DNA Computing. He is a member of the National Academy of Engineering
National Academy of Engineering
The National Academy of Engineering is a government-created non-profit institution in the United States, that was founded in 1964 under the same congressional act that led to the founding of the National Academy of Sciences...
and the National Academy of Sciences
National Academy of Sciences
National Academy of Sciences commonly refers to the academy in the United States of America.National Academy of Sciences may also refer to :* National Academy of Sciences of Argentina* Armenian National Academy of Sciences...
.
Currently, Adleman is working on the mathematical theory of Strata.http://web-app.usc.edu.vectrosuffix.com/soc/20113/csci
See also
- List of famous programmers
- Important publications in cryptography