Adi Shamir

From Infogalactic: the planetary knowledge core
Jump to: navigation, search
Adi Shamir
Adi Shamir 2009 crop.jpg
Born (1952-07-06) July 6, 1952 (age 71)
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 Erdős Prize (1983)
Paris Kanellakis Award (1996)
Turing Award (2002)
Israel 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

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

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

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

See also

References

  1. Lua error in package.lua at line 80: module 'strict' not found. (subscription required)
  2. Lua error in package.lua at line 80: module 'strict' not found.
  3. Lua error in package.lua at line 80: module 'strict' not found..
  4. Lua error in package.lua at line 80: module 'strict' not found.
  5. http://awards.acm.org/citation.cfm?id=8526038&srt=all&aw=147&ao=KANELLAK
  6. Lua error in package.lua at line 80: module 'strict' not found.
  7. Lua error in package.lua at line 80: module 'strict' not found.
  8. Lua error in package.lua at line 80: module 'strict' not found.
  9. Lua error in package.lua at line 80: module 'strict' not found.
  10. Lua error in package.lua at line 80: module 'strict' not found.

External links