Adi Shamir

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Adi Shamir
Adi Shamir 2009 crop.jpg
Born (1952-07-06) July 6, 1952 (age 61)
Tel Aviv, Israel
Residence Israel
Fields Cryptography
Institutions Weizmann Institute
Alma mater BSc Tel Aviv University, 1973
Ph.D. Weizmann Institute of Science, 1977
Doctoral advisor Zohar Manna
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 Turing Award
Israel Prize
Erdős Prize

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.

Education[edit]

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.

Research[edit]

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[1] and the NSA.[2]

Shamir has also made contributions to computer science outside of cryptography, such as finding the first linear time algorithm for 2-satisfiability[3] and showing the equivalence of the complexity classes PSPACE and IP.

Awards[edit]

Shamir has received a number of awards, including the following:

See also[edit]

References[edit]

  1. ^ Coppersmith, Don (May 1994). "The Data Encryption Standard (DES) and its strength against attacks" (PDF). IBM Journal of Research and Development 38 (3): 243. doi:10.1147/rd.383.0243.  (subscription required)
  2. ^ Levy, Steven (2001). Crypto: How the Code Rebels Beat the Government — Saving Privacy in the Digital Age. Penguin Books. pp. 55–56. ISBN 0-14-024432-8. 
  3. ^ Even, S.; Itai, A.; Shamir, A. (1976), "On the complexity of time table and multi-commodity flow problems", SIAM Journal on Computing 5 (4): 691–703, doi:10.1137/0205048 .
  4. ^ "A. M. Turing Award". Association for Computing Machinery. Retrieved February 5, 2011. 
  5. ^ http://awards.acm.org/citation.cfm?id=8526038&srt=all&aw=147&ao=KANELLAK
  6. ^ "IEEE W.R.G. Baker Prize Paper Award Recipients". IEEE. Retrieved February 5, 2011. 
  7. ^ "IEEE Koji Kobayashi Computers and Communications Award Recipients". IEEE. Retrieved February 15, 2011. 
  8. ^ "Israel Prize Official Site (in Hebrew) - Recipient's C.V.". 
  9. ^ "Israel Prize Official Site (in Hebrew) - Judges' Rationale for Grant to Recipient". 
  10. ^ "Presentation of the honorary degree at the Fall 2009 Convcation". Retrieved October 31, 2011. 

External links[edit]