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. He is also known for the creation of the field of DNA computing.

**Leonard Adleman - Wikipedia**https://en.wikipedia.org/wiki/Leonard_Adleman##### Web results:

**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. He is also known for the creation of the field of DNA computing.**Leonard**M.**Adleman**, (born Dec. 31, 1945, San Francisco, Calif., U.S.), American computer scientist and cowinner, with American computer scientist Ronald L. Rivest and Israeli cryptographer Adi Shamir, of the 2002 A.M. Turing Award, the highest honour in computer science, for their “ingenious contribution for making public-key cryptography ...- Leonard Adleman on Becoming a MathematicianYouTube
- Leonard Adleman 2002 ACM A.M. Turing Awards Lecture, "Pre-RSA Days: History and Lessons"YouTube
- Adleman: Creating the RSA CryptosystemYouTube
- Adleman: Inventing DNA ComputingYouTube

Professor

**Leonard Adleman**. Department of Computer Science. USC Viterbi School of Engineering. Department of Molecular Biology. USC Dornsife College of LAS.**Adleman**Wikipedia Page.**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.**Leonard**M.**Adleman**. 1947-American mathematician and computer scientist known for his work in computational complexity, number theory, molecular biology, immunology, and computer viruses. While at the Massachusetts Institute of Technology he helped invent the RSA Public-key Cryptosystem.