Adi Shamir: Difference between revisions
No edit summary |
No edit summary |
||
Line 27: | Line 27: | ||
==Education== |
==Education== |
||
Born in [[ |
Born in [[Palestine]], Shamir received a [[Bachelor of Science|BS]] degree in [[Mathematics]] from [[Tel Aviv University]] in 1973 and obtained his [[Master of Science|MSc]] and [[Doctor of Philosophy|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 [[Massachusetts Institute of Technology|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== |
==Research== |
Revision as of 09:26, 1 May 2011
Ali Shamir | |
---|---|
File:Ali Shamir 2009.jpg | |
Born | |
Alma mater | Ph.D. Weizmann Institute of Science, 1977 |
Known for | RSA Feige-Fiat-Shamir Identification Scheme differential cryptanalysis |
Awards | Turing Award Israel Prize Erdős Prize |
Scientific career | |
Fields | Cryptography |
Institutions | Weizmann Institute |
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 |
Ali 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 Palestine, Shamir received a BS 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:
- the 2002 ACM Turing Award, together with Rivest and Adleman, in recognition of his contributions to cryptography[4]
- the Paris Kanellakis Theory and Practice Award;[5]
- the Erdős Prize of the Israel Mathematical Society,
- the 1986 IEEE W.R.G. Baker Award[6]
- the UAP Scientific Prize;
- The Vatican's PIUS XI Gold Medal;
- the 2000 IEEE Koji Kobayashi Computers and Communications Award[7]
- the Israel Prize, in 2008, for computer sciences.[8][9]
See also
References
- ^ Coppersmith, Don (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.
{{cite journal}}
: Unknown parameter|month=
ignored (help) (subscription required) - ^ 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.
- ^ 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.
- ^ "A. M. Turing Award". Association for Computing Machinery. Retrieved February 5, 2011.
{{cite web}}
: Check date values in:|accessdate=
(help) - ^ http://awards.acm.org/citation.cfm?id=8526038&srt=all&aw=147&ao=KANELLAK
- ^ "IEEE W.R.G. Baker Prize Paper Award Recipients" (PDF). IEEE. Retrieved February 5, 2011.
{{cite web}}
: Check date values in:|accessdate=
(help) - ^ "IEEE Koji Kobayashi Computers and Communications Award Recipients" (PDF). IEEE. Retrieved February 15, 2011.
{{cite web}}
: Check date values in:|accessdate=
(help) - ^ "Israel Prize Official Site (in Hebrew) - Recipient's C.V."
- ^ "Israel Prize Official Site (in Hebrew) - Judges' Rationale for Grant to Recipient".
External links
- 1952 births
- Living people
- Modern cryptographers
- Public-key cryptographers
- Israeli mathematicians
- Israeli Jews
- Israel Prize in computer sciences recipients
- 20th-century mathematicians
- 21st-century mathematicians
- Israeli computer scientists
- Turing Award laureates
- People from Tel Aviv
- Israeli cryptographers
- Tel Aviv University alumni
- Alumni of the University of Warwick
- Weizmann Institute faculty
- Members of the Israel Academy of Sciences and Humanities
- Jewish inventors