Biography:Adi Shamir
Adi Shamir | |
|---|---|
 Shamir in 2018 | |
| Born | July 6, 1952 Tel Aviv, Israel |
| Alma mater | Tel Aviv University Weizmann Institute of Science |
| Known for | RSA Feige–Fiat–Shamir identification scheme differential cryptanalysis |
| Awards |
|
| Scientific career | |
| Fields | Cryptography |
| Institutions | Weizmann Institute Massachusetts Institute of Technology |
| Thesis | The fixedpoints of recursive definitions[2] (1976) |
| Doctoral advisor | Zohar Manna[3] |
| Doctoral students | Eli Biham Uriel Feige Amos Fiat[3] |
| Website | www |
Adi Shamir (Hebrew: עדי שמיר; born July 6, 1952) is an Israeli cryptographer. He is a co-inventor of the Rivest–Shamir–Adleman (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.[4]
Education
Born in Tel Aviv, Shamir received a Bachelor of Science (BSc) 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.[3]
Career and research
After a year as a postdoctoral researcher at the University of Warwick, he did research at Massachusetts Institute of Technology (MIT) from 1977 to 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 in the late 1980s, a general method for attacking block ciphers. It later emerged that differential cryptanalysis was already known — and kept a secret — by both IBM[5] and the National Security Agency (NSA).[6]
Shamir has also made contributions to computer science outside of cryptography, such as finding the first linear time algorithm for 2-satisfiability[7] and showing the equivalence of the complexity classes PSPACE and IP.
Awards and honors
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[8]
- the Paris Kanellakis Theory and Practice Award;[9]
- the Erdős Prize of the Israel Mathematical Society,
- the 1986 IEEE W.R.G. Baker Award[10]
- the UAP Scientific Prize[clarification needed]
- The Vatican's PIUS XI Gold Medal[11]
- the 2000 IEEE Koji Kobayashi Computers and Communications Award[12]
- the Israel Prize, in 2008, for computer sciences.[13][14]
- an honorary DMath (Doctor of Mathematics) degree from the University of Waterloo[15]
- 2017 (33rd) Japan Prize in the field of Electronics, Information and Communication for his contribution to information security through pioneering research on cryptography [16]
- he was elected a Foreign Member of the Royal Society (ForMemRS) in 2018 for substantial contribution to the improvement of natural knowledge.[1]
He was elected a Member of the American Philosophical Society in 2019.
References
- ↑ 1.0 1.1 Anon (2018). "Adi Shamir ForMemRS". London: Royal Society. https://royalsociety.org/people/adi-shamir-13842/. One or more of the preceding sentences incorporates text from the royalsociety.org website where: "All text published under the heading 'Biography' on Fellow profile pages is available under Creative Commons Attribution 4.0 International License." --
- ↑ Shamir, Adi (October 1976) (in en). The fixedpoints of recursive definitions. Weizmann Institute of Science. OCLC 884951223. https://weizmann.primo.exlibrisgroup.com/permalink/972WIS_INST/1d4esio/alma990002185270203596.
- ↑ 3.0 3.1 3.2 Adi Shamir at the Mathematics Genealogy Project
- ↑ {{DBLP}} template missing ID and not present in Wikidata.
- ↑ Coppersmith, Don (May 1994). "The Data Encryption Standard (DES) and its strength against attacks". IBM Journal of Research and Development 38 (3): 243–250. doi:10.1147/rd.383.0243. http://www.research.ibm.com/journal/rd/383/coppersmith.pdf. (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. http://awards.acm.org/homepage.cfm?srt=all&awd=140.
- ↑ "ACM Award Citation / Adi Shamir". http://awards.acm.org/citation.cfm?id=8526038&srt=all&aw=147&ao=KANELLAK.
- ↑ "IEEE W.R.G. Baker Prize Paper Award Recipients". IEEE. http://www.ieee.org/documents/baker_rl.pdf.
- ↑ "Pius XI Medal". http://www.pas.va/content/accademia/en/about/medal.html.
- ↑ "IEEE Koji Kobayashi Computers and Communications Award Recipients". IEEE. http://www.ieee.org/documents/kobayashi_rl.pdf.
- ↑ "Israel Prize Official Site (in Hebrew) - Recipient's C.V.". http://cms.education.gov.il/EducationCMS/Units/PrasIsrael/Tashsch/AdiShamir/CvAdiShamir.htm.
- ↑ "Israel Prize Official Site (in Hebrew) - Judges' Rationale for Grant to Recipient". http://cms.education.gov.il/EducationCMS/Units/PrasIsrael/Tashsch/AdiShamir/NsAdiShamir.htm.
- ↑ "Presentation of the honorary degree at the Fall 2009 Convcation". http://www.math.uwaterloo.ca/co/research/files/award_files/AShamircitation.pdf.
- ↑ "Laureates of the Japan Prize". http://www.japanprize.jp/en/prize_past_2017_prize01.html.
 |
