Template:Short description Template:Infobox scientist Adi Shamir (Template:Langx; born July 6, 1952) is an Israeli cryptographer and inventor. 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.<ref name=dblp>Template:DBLP</ref>

BiographyEdit

Adi Shamir was born in Tel Aviv. He received a Bachelor of Science (BSc) degree in mathematics from Tel Aviv University in 1973 and obtained an MSc and PhD in computer science from the Weizmann Institute in 1975 and 1977 respectively.<ref name=mathgene>Template:MathGenealogy</ref> He spent a year as a postdoctoral researcher at the University of Warwick and did research at Massachusetts Institute of Technology (MIT) from 1977 to 1980.

Scientific careerEdit

In 1980, he returned to Israel, joining 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<ref name="coppersmith">Template:Cite journal (subscription required)</ref> and the National Security Agency (NSA).<ref name="levy">Template:Cite book</ref>

Shamir has also made contributions to computer science outside of cryptography, such as finding the first linear time algorithm for 2-satisfiability<ref name="EIS76">Template:Citation.</ref> and showing the equivalence of the complexity classes PSPACE and IP.

Awards and recognitionEdit

  • 2002 ACM Turing Award, together with Rivest and Adleman, in recognition of his contributions to cryptography<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

|CitationClass=web }}</ref>

|CitationClass=web }}</ref>

  • UAP Scientific PrizeTemplate:Clarify
  • Vaticans PIUS XI Gold Medal<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

|CitationClass=web }}</ref>

  • Israel Prize, in 2008, for computer sciences.<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

  • Honorary DMath (Doctor of Mathematics) degree from the University of Waterloo<ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

  • 2017 (33rd) Japan Prize in the field of Electronics, Information and Communication for his contribution to information security through pioneering research on cryptography <ref>{{#invoke:citation/CS1|citation

|CitationClass=web }}</ref>

|CitationClass=web

}} One or more of the preceding sentences incorporates text from the royalsociety.org website where: <templatestyles src="Template:Blockquote/styles.css" />

"All text published under the heading 'Biography' on Fellow profile pages is available under Creative Commons Attribution 4.0 International License." --Template:Webarchive{{#if:|{{#if:|}}

}}

{{#invoke:Check for unknown parameters|check|unknown=Template:Main other|preview=Page using Template:Blockquote with unknown parameter "_VALUE_"|ignoreblank=y| 1 | 2 | 3 | 4 | 5 | author | by | char | character | cite | class | content | multiline | personquoted | publication | quote | quotesource | quotetext | sign | source | style | text | title | ts }}</ref>

|CitationClass=web }}</ref>

ReferencesEdit

Template:Reflist

Template:Sister project

Template:Kanellakis Award laureates Template:FRS 2018 Template:Turing award Template:Japan Prize Template:Authority control