Leonard Max Adleman (born December 31, 1945) is a 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.
Born in California, Adleman grew up in San Francisco, and attended the University of Cal...
more
Leonard Max Adleman (born December 31, 1945) is a 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.
Born in California, 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 traveling 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...
less
