#1,447

Most Influential Person

Professional biography of Adi Shamir, Israeli cryptographer, (1952 - ), Israel

**Areas of Specialization: Computational Cryptography**

Shamir is a cryptographer and professor of computer science at the Weizmann Institute of Science in Israel. He received a bachelor’s degree in Mathematics from Tel Aviv University in 1973, and a master’s and Ph.D. in computer science at Weizmann in the 1975 and 1977.

Shamir became famous for his co-invention of one of the world’s first public key cryptosytems, RSA (which bears his name: it’s an acronym for Rivest-Shamir-Adleman). The RSA public key system has been widely adopted by businesses and individuals to securely send encrypted messages, as in email or other data transmissions over a network. He has also done pioneering work in visual cryptography, and developed a powerful technique known as “differential” cryptography—though it was later revealed that the top secret National Security Agency (NSA) had developed and used the technique secretly. Nonetheless, for his many important discoveries in the field, Shamir is one of the true fathers of computational cryptography.

Shamir has received many awards recognizing his contributions to computer science and cryptology. In 2002 he received the highest honor in computer science, the Turing Award. He has also been honored by the Vatican with the PIUS XI Gold Medal, and was elected in 2018 as a Foreign Member of the Royal Society for his substantial contribution to human knowledge. Quite a career, indeed.

**Featured in Top Influential Computer Scientists Today**

According to Wikipedia, Adi Shamir is an Israeli cryptographer. He is a co-inventor of the Rivest–Shamir–Adleman algorithm , a co-inventor of the Feige–Fiat–Shamir identification scheme , one of the inventors of differential cryptanalysis and has made numerous contributions to the fields of cryptography and computer science.

- How to share a secret (1979) (12505)
- A method for obtaining digital signatures and public-key cryptosystems (1978) (9900)
- A method for obtaining digital signatures and public-key cryptosystems (1978) (9113)
- Identity-Based Cryptosystems and Signature Schemes (1984) (6697)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (1986) (3808)
- Visual Cryptography (1994) (2630)
- Differential cryptanalysis of DES-like cryptosystems (1990) (2430)
- Differential Fault Analysis of Secret Key Cryptosystems (1997) (1608)
- How to Leak a Secret (2001) (1528)
- Cache Attacks and Countermeasures: The Case of AES (2006) (1275)
- Weaknesses in the Key Scheduling Algorithm of RC4 (2001) (1257)
- On the Complexity of Timetable and Multicommodity Flow Problems (1976) (1076)
- Differential Cryptanalysis of the Data Encryption Standard (1993) (998)
- Quantitative Analysis of the Full Bitcoin Transaction Graph (2013) (888)
- Zero-knowledge proofs of identity (1988) (871)
- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations (2000) (800)
- IP = PSPACE (1992) (754)
- PayWord and MicroMint: Two Simple Micropayment Schemes (1996) (743)
- Time-lock Puzzles and Timed-release Crypto (1996) (665)
- Witness indistinguishable and witness hiding protocols (1990) (589)
- Real Time Cryptanalysis of A5/1 on a PC (2000) (525)
- The LSD Broadcast Encryption Scheme (2002) (441)
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials (1999) (441)
- Cube Attacks on Tweakable Black Box Polynomials (2009) (440)
- Efficient Cache Attacks on AES, and Countermeasures (2010) (434)
- Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization (1999) (434)
- RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis (2014) (405)
- On the complexity of time table and multi-commodity flow problems (1975) (403)
- Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers (2000) (391)
- Improved Online/Offline Signature Schemes (2001) (376)
- A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem (1982) (373)
- IoT Goes Nuclear: Creating a ZigBee Chain Reaction (2017) (365)
- A Practical Attack on Broadcast RC4 (2001) (339)
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions (1999) (298)
- Zero Knowledge Proofs of Knowledge in Two Rounds (1989) (289)
- How to Reuse a "Write-Once" Memory (1982) (265)
- On the generation of cryptographically strong pseudorandom sequences (1983) (253)
- Multiple non-interactive zero knowledge proofs based on a single random string (1990) (251)
- On Digital Signatures and Public-Key Cryptosystems. (1977) (239)
- An optimal sorting algorithm for mesh connected computers (1986) (235)
- Lattice Attacks on NTRU (1997) (223)
- The Steganographic File System (1998) (203)
- Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds (2010) (203)
- Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium (2009) (201)
- Structural Cryptanalysis of SASAS (2001) (201)
- Visual Cryptography II: Improving the Contrast Via the Cover Base (1996) (194)
- Playing "Hide and Seek" with Stored Keys (1999) (184)
- Breaking Grain-128 with Dynamic Cube Attacks (2011) (183)
- Fault Analysis of Stream Ciphers (2004) (172)
- A T=O(2n/2), S=O(2n/4) Algorithm for Certain NP-Complete Problems (1981) (171)
- Zero knowledge proofs of identity (1987) (170)
- Miss in the Middle Attacks on IDEA and Khufu (1999) (163)
- Extended Functionality Attacks on IoT Devices: The Case of Smart Lights (2016) (163)
- A New Class of Invertible Mappings (2002) (161)
- SQUASH - A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags (2008) (161)
- How to expose an eavesdropper (1984) (159)
- Protecting Smart Cards from Passive Power Analysis with Detached Power Supplies (2000) (156)
- Practical Cryptanalysis of SFLASH (2007) (155)
- Differential Cryptanalysis of the Full 16-Round DES (1992) (147)
- Cryptanalysis of the HFE Public Key Cryptosystem (1999) (137)
- Efficient Signature Schemes Based on Birational Permutations (1993) (131)
- Cryptanalysis of the Oil & Vinegar Signature Scheme (1998) (130)
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited (2012) (130)
- Improved Single-Key Attacks on 8-Round AES-192 and AES-256 (2015) (121)
- Factoring large numbers with the TWIRL device (2003) (116)
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences (1988) (116)
- On the Generation of Cryptographically Strong Pseudo-Random Sequences (1981) (115)
- Analysis of Neural Cryptography (2002) (112)
- Cryptographic Applications of T-Functions (2003) (109)
- A Video Scrambling Technique Based On Space Filling Curves (1987) (102)
- A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony (2010) (100)
- How to Leak a Secret: Theory and Applications of Ring Signatures (2006) (98)
- Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer (1991) (94)
- Differential Cryptanalysis of Feal and N-Hash (1991) (94)
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs (1990) (92)
- Factoring Large Numbers with the Twinkle Device (Extended Abstract) (1999) (90)
- Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs (2006) (90)
- Second Preimage Attacks on Dithered Hash Functions (2008) (89)
- New Cryptographic Primitives Based on Multiword T-Functions (2004) (86)
- An efficient signature scheme based on quadratic equations (1984) (86)
- Generalized 'write-once' memories (1984) (84)
- Efficient Factoring Based on Partial Information (1985) (83)
- The Discrete Logarithm Modulo a Composite Hides O(n) Bits (1993) (79)
- New Attacks on Keccak-224 and Keccak-256 (2012) (78)
- Fully parallelized multi prover protocols for NEXP-time (1991) (77)
- An Improvement of the Fiat-Shamir Identification and Signature Scheme (1988) (75)
- An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware (2011) (74)
- Efficient FPGA Implementations of High-Dimensional Cube Testers on the Stream Cipher Grain-128 (2009) (74)
- Remote Password Extraction from RFID Tags (2007) (73)
- A Practical-Time Attack on the A5/3 Cryptosystem Used in Third Generation GSM Telephony (2010) (73)
- An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract) (1989) (72)
- Collision-Based Power Analysis of Modular Exponentiation Using Chosen-Message Pairs (2008) (72)
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems (2012) (71)
- Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks (1986) (70)
- Improved Attacks on Full GOST (2012) (70)
- Factoring Estimates for a 1024-Bit RSA Modulus (2003) (69)
- Fast Exhaustive Search for Polynomial Systems in F2 (2010) (69)
- A Simple Explanation for the Existence of Adversarial Examples with Small Hamming Distance (2019) (68)
- Factoring Numbers in O(log n) Arithmetic Steps (1979) (65)
- Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials (2013) (64)
- Acoustic Cryptanalysis (2017) (64)
- Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions (2006) (62)
- Side Channel Cube Attacks on Block Ciphers (2009) (61)
- IoT Goes Nuclear: Creating a Zigbee Chain Reaction (2017) (57)
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs (1979) (55)
- Analysis and Optimization of the TWINKLE Factoring Device (2000) (54)
- New Applications of T-Functions in Block Ciphers and Hash Functions (2005) (53)
- Analysis of Bernstein's Factorization Circuit (2002) (52)
- Initial Observations on Skipjack: Cryptanalysis of Skipjack-3XOR (1998) (51)
- The cryptographic security of truncated linearly related variables (1985) (50)
- Comparative Power Analysis of Modular Exponentiation Algorithms (2010) (50)
- On the Power of Commutativity in Cryptography (1980) (48)
- Un-Trusted-HB: Security Vulnerabilities of Trusted-HB (2009) (47)
- Improved Single-Key Attacks on 8-round AES (2010) (47)
- How Did Dread Pirate Roberts Acquire and Protect his Bitcoin Wealth? (2014) (46)
- Bug Attacks (2008) (45)
- On the cryptographic security of single RSA bits (1983) (45)
- On the cryptocomplexity of knapsack systems (1979) (45)
- On the Security of DES (1985) (45)
- On the security of the Merkle- Hellman cryptographic scheme (Corresp.) (1980) (44)
- Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2 (2013) (44)
- Physical key extraction attacks on PCs (2016) (43)
- Memory Efficient Variants of Public-Key Schemes for Smart Card Applications (1994) (42)
- Efficient Signature Schemes Based on Polynomial Equations (1984) (41)
- How to Copyright a Function? (1999) (41)
- A Fast Signature Scheme (1978) (41)
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (2008) (40)
- Factoring Large Number with the TWIRL Device (2003) (39)
- The Theoretical Aspects of the Optimal Fixed Point (1976) (39)
- Miss in the Middle Attacks on IDEA, Khufu and Khafre (1999) (38)
- The discrete log is very discreet (1990) (38)
- On the Universality of the Next Bit Test (1990) (36)
- The 9 Lives of Bleichenbacher's CAT: New Cache ATtacks on TLS Implementations (2019) (35)
- The Noisy Oracle Problem (1988) (35)
- How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs (2017) (34)
- On the Security of Ping-Pong Protocols when Implemented using the RSA (1985) (34)
- SecureClick: A Web Payment System with Disposable Credit Card Numbers (2002) (34)
- Guaranteeing the Diversity of Number Generators (2001) (32)
- Improved On-line / Off-line Signature Schemes (32)
- Length-based cryptanalysis: the case of Thompson's group (2006) (30)
- Stream Ciphers: Dead or Alive? (2004) (29)
- On the Cost of Factoring RSA-1024 (2003) (29)
- Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities (2019) (29)
- How to reuse a "write - once " memory (Preliminary Version) (1982) (28)
- Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys (2014) (27)
- Data Types as Objects (1977) (27)
- Applying cube attacks to stream ciphers in realistic scenarios (2012) (27)
- Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization (2005) (26)
- A TcS2 = 0 (2n) time/space tradeoff for certain NP-complete problems (1979) (26)
- A one-round, two-prover, zero-knowledge protocol for NP (1991) (26)
- Drones' Cryptanalysis - Smashing Cryptography with a Flicker (2019) (25)
- New Data-Efficient Attacks on Reduced-Round IDEA (2011) (25)
- Multi-Oracle Interactive Protocols with Constant Space Verifiers (1992) (24)
- Improved Practical Attacks on Round-Reduced Keccak (2014) (23)
- Privacy-Preserving Automated Exposure Notification (2020) (23)
- Fully Parallelized Multi-Prover Protocols for NEXP-Time (1991) (23)
- On the generation of multivariate polynomials which are hard to factor (1993) (23)
- Slidex Attacks on the Even–Mansour Encryption Scheme (2013) (23)
- New Attacks on Feistel Structures with Improved Memory Complexities (2015) (23)
- Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers (1984) (22)
- The optimal approach to recursive programs (1977) (22)
- Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions (2007) (22)
- IP=PSPACE (interactive proof=polynomial space) (1990) (21)
- Pseudo Constant Time Implementations of TLS Are Only Pseudo Secure (2018) (21)
- New Second-Preimage Attacks on Hash Functions (2016) (20)
- Pkcs #7: Cryptographic Message Syntax (1997) (19)
- The Story Of Non-Secret Encryption (1997) (19)
- The Retracing Boomerang Attack (2020) (18)
- Lamphone: Real-Time Passive Sound Recovery from Light Bulb Vibrations (2020) (18)
- An Improved Algebraic Attack on Hamsi-256 (2011) (18)
- Key Recovery Attacks on Iterated Even–Mansour Encryption Schemes (2016) (17)
- The Dimpled Manifold Model of Adversarial Examples in Machine Learning (2021) (17)
- Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems (1983) (17)
- RFID Authentication Efficient Proactive Information Security within Computational Security (2009) (17)
- Security of Almost ALL Discrete Log Bits (1998) (16)
- The Convergence of Functions to Fixedpoints of Recursive Definitions (1977) (16)
- Differential Cryptanalysis of DES Variants (1993) (16)
- New Attacks on IDEA with at Least 6 Rounds (2015) (16)
- Multi-oracle interactive protocols with space bounded verifiers (1989) (16)
- Cryptanalysis of Certain Variants of Rabin's Signature Scheme (1984) (15)
- Real Time Cryptanalysis of the Alleged A5/1 on a PC (1999) (15)
- On Dice and Coins: Models of Computation for Random Generation (1989) (15)
- Planning and learning in permutation groups (1989) (14)
- Improved Top-Down Techniques in Differential Cryptanalysis (2015) (13)
- ALRED Blues: New Attacks on AES-Based MAC's (2011) (13)
- How to find a battleship (1989) (12)
- Self-Differential Cryptanalysis of Up to 5 Rounds of SHA-3 (2012) (12)
- Visual Cryptanalysis (1998) (11)
- A Practical-Time Attack on the KASUMI Cryptosystem Used in GSM and 3 G Telephony (2010) (11)
- Xerox Day Vulnerability (2019) (11)
- Number-Theoretic Functions Which Are Equivalent to Number of Divisors (1985) (11)
- The optimal fixedpoint of recursive programs (1975) (10)
- Cryptography: State of the science (2011) (9)
- Differential Cryptanalysis of FEAL (1993) (9)
- Oops!...I think I scanned a malware (2017) (9)
- Game of Drones - Detecting Streamed POI from Encrypted FPV Channel (2018) (9)
- A new approach to recursive programs. (1975) (8)
- Real Time Cryptanalysis of theAlleged A 5 / 1 on a PC ( preliminary draft ) (1999) (7)
- Universal tests for nonuniform distributions (1993) (7)
- Reflections on slide with a twist attacks (2015) (7)
- Improved Related-key Attacks on DESX and DESX+ (2008) (7)
- Generic Analysis of Small Cryptographic Leaks (2010) (6)
- Memory-Efficient Algorithms for Finding Needles in Haystacks (2016) (6)
- Dissection (2014) (6)
- How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs (2014) (6)
- The Cryptographic Security of Compact Knapsacks. (1980) (6)
- Analysis of the Non-linear Part of Mugi (2005) (5)
- Polymorphic Arrays: An Architecture for a Programmable Systolic Machine (1985) (5)
- Almost universal forgery attacks on AES-based MAC’s (2015) (5)
- New Directions in Croptography (2001) (5)
- Dissection: a new paradigm for solving bicomposite search problems (2014) (4)
- Improved Linear Sieving Techniques with Applications to Step-Reduced LED-64 (2014) (4)
- Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions (2014) (4)
- Summary of an Open Discussion on IoT and Lightweight Cryptography (2017) (4)
- Differential Cryptanalysis of Other Cryptosystems (1993) (4)
- New Slide Attacks on Almost Self-Similar Ciphers (2020) (4)
- The Cryptographic Security of Compact Knapsacks (Preliminary Report) (1980) (3)
- Detecting Spying Drones (2021) (3)
- Special-Purpose Hardware for Factoring: the NFS Sieving Step (2005) (3)
- On the Method of "xl" and Its Ineeciency to Ttm (2000) (3)
- Time-lock puzzles and timed-release (1996) (3)
- The Search for Provably Secure Identification Schemes (2010) (3)
- TCP SYN Flooding (2004) (3)
- Three Third Generation Attacks on the Format Preserving Encryption Scheme FF3 (2021) (2)
- Tight Bounds on Online Checkpointing Algorithms (2017) (2)
- Introduction to Differential Cryptanalysis (1993) (2)
- How to Share a Secret (1979) (2021) (2)
- Cryptanalysis of the Shpilrain-Ushakov Thompson group cryptosystem (2005) (2)
- Differential Cryptanalysis of Hash Functions (1993) (2)
- Experimentally Verifying a Complex Algebraic Attack on the Grain-128 Cipher Using Dedicated Reconfigurable Hardware (2012) (2)
- An Experimentally Veri ed Attack on Full Grain-128 Using Dedicated Recon gurable Hardware (2011) (1)
- Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications (2018) (1)
- Finding Minimum Cutsets in Reducible Graphs (1977) (1)
- RSA Shortcuts (2003) (1)
- Information, Data, Security in a Networked Future (2012) (1)
- Error Resilient Space Partitioning (Invited Talk) (2021) (1)
- Error Resilient Space Partitioning (2021) (1)
- Cryptanalysis of the SFLASH Signature Scheme (2007) (1)
- Time lock puzzles and timed (1996) (1)
- Weaknesses in the Key S heduling Algorithm ofRC 4 (2007) (1)
- Game of Drones - Detecting Spying Drones Using Time Domain Analysis (2021) (1)
- On Expected Polynomial Time Simulation of Zero Knowledge Protocols (1989) (1)
- Optimal Backup Strategies Against Cyber Attacks (2017) (0)
- RSA ENCRYPTION AND DIFFIE HELLMAN KEY EXCHANGE (2009) (0)
- Practical Cryptography - Recent Trends and Results (1993) (0)
- SE 4 C 03 Winter 2004 Quantum Computation and Classical Encryption (2004) (0)
- Practical Polynomial Time Known Plaintext Attacks on a Stream Cipher Proposed by John Nash (2012) (0)
- 3 the Rsa Function 13.1 Modular Arithmetic & Number Theory Greatest Common Divisors (0)
- PayWord and MicroMint ( extended abstract ) (2012) (0)
- Cryptography (Dagstuhl Seminar 02391) (2021) (0)
- Visual Cryptography with Polarization (2006) (0)
- Efficient Digital Signature Schemes Based on Multivariate Polynomial Equations (1987) (0)
- Consistent High Dimensional Rounding with Side Information (2020) (0)
- The method, device and apparatus for identifying and sign. (1987) (0)
- Quantum Time/Memory/Data Tradeoff Attacks (2021) (0)
- Cryptographic Rsa Research and Consultation Rsa for Paranoids Editor's Note (0)
- A COMPARISION STUDY OF RSA AND DSA ALGORITHM IN MOBILE CLOUD COMPUTING K.Sivaraman (2017) (0)
- Cryptography: state of the science par Adi Shamir (2003) (0)
- RSA-Past, Present, Future (2008) (0)
- POSTER: Recovering Songs from a Hanging Light Bulb (2021) (0)
- after the latest revision in 2012 : Grain v 1 [ (2017) (0)
- Smartcard protection against power analysis separate power. (2000) (0)
- Non-Differential Cryptanalysis of DES with a Small Number of Rounds (1993) (0)
- Timed Modal Specifications........ 8 (0)
- Feasibility of a Quantum Computer Architecture Feasibility of a Quantum Computer Architecture (1996) (0)
- THE THEORETICAL ASPECTS OF THE OPTIMAL FltiEDPOlNTm bY (1998) (0)
- Efficient Signature Schemes Based on Birat ional Perrnutat ions (1994) (0)
- Themes Complexity Theory ’ 94 In the months of August and September , 1994 (0)
- Critical Review of Imperfect Forward Secrecy (2016) (0)
- ov 2 00 2 On ASGS framework : general requirements and an example of implementation (2002) (0)
- Demo: Detecting Illicit Drone Video Filming Using Cryptanalysis (2021) (0)
- RSA Attacks By Abdulaziz Alrasheed and Fatima 1 Introduction Invented (2014) (0)
- A Practical Polynomial-Time Known-Plaintext Attack on a Cryptosystem Proposed by John Nash (2012) (0)

This paper list is powered by the following services:

Adi Shamir is affiliated with the following schools:

This website uses cookies to enhance the user experience. Read the Privacy Policy for more.

Subscribe To Newsletter?Yes!