AOL Web Search

Adleman reported his brilliant discovery in the November 1994 issue of Science (see [9]) and he is now rightly hailed as the 'father of DNA computation'. One of the most exciting fields in contemporary scientific research, molecular computation has witnessed some remarkable breakthroughs in the years following Adleman's experiment.

Without doubt, Leonard Adleman’s most famous work is his contribution to the RSA algorithm (named after him, Rivest and Shamir) published in 1978 under the title “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”.

Leonard Adleman is a Henry Salvatori Professor of Computer Science and Professor of Molecular Biology at the University of Southern California. He is known for his research on algorithms, complexity, cryptography, DNA computing, immunology and molecular biology. He has won several awards and honors, including the IEEE Kobayashi Award, the RSA Chair and the ACM Paris Kanallakis Award.

Leonard M. Adleman is a mathematician and computer scientist who won the A.M. Turing Award in 2002 for his contributions to public-key cryptography, DNA computing, and complex analysis. He is a professor at the University of Southern California and the Henry Salvatori Professor of Computer Science and Molecular Biology. He has also worked on primality testing, Fermat's Last Theorem, and AIDS research.

Learn about the life and achievements of Leonard Max Adleman, a computer scientist and educator who co-invented the RSA cryptosystem and DNA computing. He is a member of the National Academy of Sciences and National Academy of Engineering and has conducted research on primality testing and combinatorial problems.