# Adi Shamir

#474

Most Influential Person Now

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

## Adi Shamir's AcademicInfluence.com Rankings

Adi Shamircomputer-science Degrees

Computer Science

#67

World Rank

#69

Historical Rank

Algorithms

#4

World Rank

#4

Historical Rank

Adi Shamirmathematics Degrees

Mathematics

#296

World Rank

#640

Historical Rank

Measure Theory

#61

World Rank

#100

Historical Rank

## Download Badge

Computer Science Mathematics

## Adi Shamir's Degrees

- PhD Computer Science Weizmann Institute of Science
- Masters Mathematics Weizmann Institute of Science
- Bachelors Mathematics Tel Aviv University

## Similar Degrees You Can Earn

## Why Is Adi Shamir Influential?

(Suggest an Edit or Addition)According to Wikipedia, Adi Shamir is an Israeli cryptographer and inventor. 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.

## Adi Shamir's Published Works

### Published Works

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

This paper list is powered by the following services:

## Other Resources About Adi Shamir

## What Schools Are Affiliated With Adi Shamir?

Adi Shamir is affiliated with the following schools: