|Institutions Weizmann Institute|
Name Adi Shamir
Doctoral advisor Zohar Manna
|Born July 6, 1952 (age 63)
Tel Aviv, Israel (1952-07-06) |
Alma mater BSc Tel Aviv University, 1973 Ph.D. Weizmann Institute of Science, 1977
Doctoral students Mira Balaban Eli Biham Uriel Feige Amos Fiat Alexander Klimov Dror Lapidot Avital Schrift (Wierzba) Ziv Soferman Eran Tromer
Known for RSA Feige–Fiat–Shamir identification scheme differential cryptanalysis
Notable awards Erdos Prize (1983) Paris Kanellakis Award (1996) Turing Award (2002) Israel Prize
Education Weizmann Institute of Science (1977), Weizmann Institute of Science (1975), Tel Aviv University (1973)
Awards Turing Award, Israel Prize, Anna and Lajos Erdos Prize in Mathematics
Similar People Leonard Adleman, Ronald Rivest, Eli Biham, Shafi Goldwasser, Uriel Feige
Adi shamir on cryptography
Adi Shamir (Hebrew: עדי שמיר; born July 6, 1952) is an Israeli cryptographer. He is a co-inventor of the RSA algorithm (along with Ron Rivest and Len Adleman), a co-inventor of the Feige–Fiat–Shamir identification scheme (along with Uriel Feige and Amos Fiat), one of the inventors of differential cryptanalysis and has made numerous contributions to the fields of cryptography and computer science.
Born in Tel Aviv, Shamir received a BSc degree in mathematics from Tel Aviv University in 1973 and obtained his MSc and PhD degrees in Computer Science from the Weizmann Institute in 1975 and 1977 respectively. His thesis was titled, "Fixed Points of Recursive Programs and their Relation in Differential Agard Calculus". After a year postdoc at University of Warwick, he did research at MIT from 1977–1980 before returning to be a member of the faculty of Mathematics and Computer Science at the Weizmann Institute. Starting from 2006, he is also an invited professor at École Normale Supérieure in Paris.
In addition to RSA, Shamir's other numerous inventions and contributions to cryptography include the Shamir secret sharing scheme, the breaking of the Merkle-Hellman knapsack cryptosystem, visual cryptography, and the TWIRL and TWINKLE factoring devices. Together with Eli Biham, he discovered differential cryptanalysis, a general method for attacking block ciphers. It later emerged that differential cryptanalysis was already known — and kept a secret — by both IBM and the NSA.
Shamir has also made contributions to computer science outside of cryptography, such as finding the first linear time algorithm for 2-satisfiability and showing the equivalence of the complexity classes PSPACE and IP.
Shamir has received a number of awards, including the following: