Adi Shamir
Get Adi Shamir essential facts below. View Videos or join the Adi Shamir discussion. Add Adi Shamir to your Like2do.com topic list for future reference or share this resource on social media.
Adi Shamir

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. ^ 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. Archived (PDF) from the original on 2007-06-15.  (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. Archived from the original on 2009-12-12. Retrieved 2011. 
  5. ^ "Archived copy". Archived from the original on 2009-04-06. Retrieved . 
  6. ^ "IEEE W.R.G. Baker Prize Paper Award Recipients" (PDF). IEEE. Archived from the original (PDF) on 2011-04-25. Retrieved 2011. 
  7. ^ "IEEE Koji Kobayashi Computers and Communications Award Recipients" (PDF). IEEE. Archived (PDF) from the original on 2010-11-24. Retrieved 2011. 
  8. ^ "Israel Prize Official Site (in Hebrew) - Recipient's C.V." Archived from the original on 2012-09-10. 
  9. ^ "Israel Prize Official Site (in Hebrew) - Judges' Rationale for Grant to Recipient". Archived from the original on 2012-09-10. 
  10. ^ "Presentation of the honorary degree at the Fall 2009 Convcation" (PDF). Archived from the original (PDF) on 2011-09-24. Retrieved 2011. 
  11. ^ "Laureates of the Japan Prize". Archived from the original on 2017-02-04. 

External links


  This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Adi_Shamir
 



 

Top US Cities