Adi Shamir (Hebrew: עדי שמיר; 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.[4]
Adi Shamir
| |
|---|---|
Shamir in 2018
| |
| Born | (1952-07-06) July 6, 1952 (age 72)
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 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 PhDincomputer science from the Weizmann Institute in 1975 and 1977 respectively.[3] 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.
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[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.
He was elected a Member of the American Philosophical Society in 2019.
"All text published under the heading 'Biography' on Fellow profile pages is available under Creative Commons Attribution 4.0 International License." --Royal Society Terms, conditions and policies at the Wayback Machine (archived 2016-11-11)
