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, often called the Nobel prize of Computer science.[1] He is also known for the creation of the field of DNA computing.

Contents Biography 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 BA 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] He is a member of the National Academy of Engineering[5] and the National Academy of Sciences.[6]

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

Discovery 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]

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.[10][11]

Fred Cohen, in his 1984 paper, Experiments with Computer Viruses has credited Adleman with coining the term "virus".[12] He is also widely referred to as the Father of DNA Computing.[13][14]

Currently, Adleman is working on the mathematical theory of Strata. He is a Computer Science professor at the University of Southern California.[15]

Awards 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.[1] Adleman was elected a Fellow of the American Academy of Arts and Sciences in 2006.[16]

לאונרד מקס אדלמן

''''''(באנגלית: Leonard Max Adleman; נולד ב-31 בדצמבר 1945) הוא פרופסור יהודי-אמריקאי למדעי המחשב ולביולוגיה מולקולרית באוניברסיטת דרום קליפורניה. ידוע בעיקר בזכות חלקו בפיתוח מערכת ההצפנה במפתח פומבי RSA, ופיתוחיו בתחום המחשוב המולקולרי.

קורות חיים אדלמן למד באוניברסיטת ברקלי שבקליפורניה, ושם קיבל תואר דוקטור בשנת 1976.

בשנת 1994 תיאר במאמרו Molecular Computation of Solutions To Combinatorial Problems (חישוב מולקולרי של פתרונות לבעיות קומבינטוריות) את השימוש הניסויי בDNA ככלי חישוב. מאמר זה היה ההצלחה הראשונה בשימוש ב-DNA כדי לחשב אלגוריתמים. עבודתו הראתה שלחישוב מולקולרי יש פוטנציאל ככלי לפתרון בעיות קומבינטוריות.

בעקבות תרומתו להמצאת מערכת ההצפנה RSA, הנמצאת בשימוש נרחב ביותר, קיבל אדלמן את פרס טיורינג לשנת 2002, יחד עם שותפיו רון ריבסט ועדי שמיר (השם RSA הוא ראשי התיבות של שמות המשפחה של השלושה).

ב-2006 נבחר כחבר האקדמיה האמריקאית לאמנויות ולמדעים ולאקדמיה הלאומית למדעים של ארצות הברית.

אדלמן היה היועץ המתמטי למפיקי הסרט "סניקרס", שגיבוריו הם האקרים העוסקים בפיצוח מערכות הצפנה.

קישורים חיצוניים Green globe.svg אתר האינטרנט הרשמי

של לאונרד אדלמן ויקישיתוף מדיה וקבצים בנושא לאונרד אדלמן בוויקישיתוף עמוד הבית של לאונרד אדלמן לאונרד אדלמן

באתר פרס טיורינג (באנגלית) לאונרד אדלמן , באתר פרויקט הגנאלוגיה במתמטיקה לאונרד אדלמן , באתר MacTutor (באנגלית) לאונרד אדלמן , באתר dblp

https://he.wikipedia.org/wiki/%D7%9C%D7%90%D7%95%D7%A0%D7%A8%D7%93_...

----------------------------

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, often called the Nobel prize of Computer science.[1] He is also known for the creation of the field of DNA computing.

Contents Biography 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 BA 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] He is a member of the National Academy of Engineering[5] and the National Academy of Sciences.[6]

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

Discovery 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]

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.[10][11]

Fred Cohen, in his 1984 paper, Experiments with Computer Viruses has credited Adleman with coining the term "virus".[12] He is also widely referred to as the Father of DNA Computing.[13][14]

Currently, Adleman is working on the mathematical theory of Strata. He is a Computer Science professor at the University of Southern California.[15]

Awards 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.[1] Adleman was elected a Fellow of the American Academy of Arts and Sciences in 2006.[16]