This article relies excessively on references to primary sources. Please improve this article by adding secondary or tertiary sources. Find sources: "Leonard Adleman" – news · newspapers · books · scholar · JSTOR (May 2020) (Learn how and when to remove this template message)

Leonard Adleman | |
---|---|

Born | Leonard Max Adleman December 31, 1945 San Francisco, California, US |

Nationality | American |

Alma mater | University of California, Berkeley |

Known for | RSA |

Awards | 2002 Turing Award |

Scientific career | |

Fields | Computer science, Cryptography |

Institutions | University of Southern California |

Thesis | Number-Theoretic Aspects of Computational Complexity (1976) |

Doctoral advisor | Manuel Blum |

**Leonard Adleman** (born December 31, 1945) is an American computer scientist. He is one of the creators of the RSA encryption algorithm, for which he received the 2002 Turing Award.^{[1]} He is also known for the creation of the field of DNA computing.

Leonard M. Adleman was born to a Jewish^{[2]} family in California. His family had originally immigrated to the United States from modern-day Belarus, from the Minsk area.^{[2]} 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.^{[1]}^{[3]} He was also the mathematical consultant on the movie *Sneakers*.^{[4]} In 1996, he became a member of the National Academy of Engineering^{[5]} for contributions to the theory of computation and cryptography. He is also a member of the National Academy of Sciences.^{[6]}

Adleman is also an amateur boxer and has sparred with James Toney.^{[7]}

In 1994, his paper *Molecular Computation of Solutions To Combinatorial Problems* described the experimental use of DNA as a computational system.^{[8]} 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.^{[9]} Adleman is widely referred to as the Father of DNA Computing.^{[10]}

In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation.^{[citation needed]} 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.^{[1]}

He is one of the original discoverers of the Adleman–Pomerance–Rumely primality test.^{[11]}^{[12]}

Fred Cohen, in his 1984 paper, *Experiments with Computer Viruses* credited Adleman with coining the term "computer virus".^{[13]}

As of 2017, Adleman is working on the mathematical theory of Strata. He is a Computer Science professor at the University of Southern California.^{[14]}

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 Turing Award, often called the Nobel Prize of Computer Science.^{[1]} Adleman was elected a Fellow of the American Academy of Arts and Sciences in 2006^{[15]} and a 2021 ACM Fellow.^{[16]}