#1447 Overall Influence

Professional biography of Adi Shamir, Israeli cryptographer

Shamir is a cryptographer and professor of computer science at the Wiezmann 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**

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.

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

Tel Aviv University

Israeli University in Tel Aviv

Massachusetts Institute of Technology

Research university in Cambridge, Massachusetts, United States

Weizmann Institute of Science

Public research university in Rehovot, Israel

University of Warwick

University in Coventry, United Kingdom

#91 World Rank

Computer Science

#800 World Rank

Mathematics

Want to be an Academic Influence Insider?

Sign up to get the latest news, information, and rankings in our upcoming newsletter.