Adi Shamir

From MaRDI portal
Person:321301

Available identifiers

zbMath Open shamir.adiDBLPs/AdiShamirWikidataQ320624 ScholiaQ320624MaRDI QIDQ321301

List of research outcomes





PublicationDate of PublicationType
Polynomial time cryptanalytic extraction of neural network models2024-11-13Paper
The retracing boomerang attack, with application to reduced-round AES2024-08-30Paper
Quantum time/memory/data tradeoff attacks2024-01-15Paper
Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50753092022-05-12Paper
https://portal.mardi4nfdi.de/entity/Q50753102022-05-12Paper
Three third generation attacks on the format preserving encryption scheme FF32021-12-08Paper
New slide attacks on almost self-similar ciphers2021-12-01Paper
The retracing boomerang attack2021-12-01Paper
Tight Bounds on Online Checkpointing Algorithms2021-07-28Paper
Tight Bounds on Online Checkpointing Algorithms2021-05-03Paper
Improved key recovery attacks on reduced-round AES with practical data and memory complexities2020-06-15Paper
Efficient dissection of bicomposite problems with cryptanalytic applications2019-11-27Paper
Improved key recovery attacks on reduced-round AES with practical data and memory complexities2018-09-26Paper
Remote Password Extraction from RFID Tags2018-06-12Paper
How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs2018-01-05Paper
Comparative Power Analysis of Modular Exponentiation Algorithms2017-07-27Paper
Acoustic cryptanalysis2017-05-22Paper
Identity-Based Cryptosystems and Signature Schemes2017-04-10Paper
Memory-Efficient Algorithms for Finding Needles in Haystacks2016-10-27Paper
Key recovery attacks on iterated Even-Mansour encryption schemes2016-10-13Paper
New second-preimage attacks on hash functions2016-10-13Paper
Bug attacks2016-10-13Paper
New Attacks on Feistel Structures with Improved Memory Complexities2015-12-10Paper
Reflections on slide with a twist attacks2015-10-26Paper
Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials2015-09-18Paper
Improved Linear Sieving Techniques with Applications to Step-Reduced LED-642015-09-18Paper
Improved Top-Down Techniques in Differential Cryptanalysis2015-09-17Paper
Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions2015-09-10Paper
Almost universal forgery attacks on AES-based MAC's2015-09-01Paper
Improved single-key attacks on 8-round AES-192 and AES-2562015-08-03Paper
New attacks on IDEA with at least 6 rounds2015-05-12Paper
On the generation of multivariate polynomials which are hard to factor2015-05-07Paper
Slidex attacks on the Even-Mansour encryption scheme2015-03-25Paper
Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys2015-01-16Paper
A practical-time related-key attack on the \texttt{KASUMI} cryptosystem used in GSM and 3G telephony2015-01-07Paper
Improved practical attacks on round-reduced Keccak2014-09-25Paper
How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGs2014-08-07Paper
RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis2014-08-07Paper
Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES22013-12-10Paper
Applying cube attacks to stream ciphers in realistic scenarios2013-06-24Paper
New Attacks on Keccak-224 and Keccak-2562013-01-08Paper
Improved Attacks on Full GOST2013-01-08Paper
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems2012-09-25Paper
Minimalism in Cryptography: The Even-Mansour Scheme Revisited2012-06-29Paper
An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware2011-12-02Paper
An Improved Algebraic Attack on Hamsi-2562011-07-07Paper
Breaking Grain-128 with Dynamic Cube Attacks2011-07-07Paper
RFID authentication efficient proactive information security within computational security2011-04-01Paper
Improved Single-Key Attacks on 8-Round AES-192 and AES-2562010-12-07Paper
Structural cryptanalysis of SASAS2010-11-12Paper
A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony2010-08-24Paper
Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$2010-08-17Paper
Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds2010-06-01Paper
Efficient cache attacks on AES, and countermeasures2010-03-01Paper
Advances in Cryptology - ASIACRYPT 20032010-01-05Paper
Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium2009-08-11Paper
Cube Attacks on Tweakable Black Box Polynomials2009-05-12Paper
Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions2009-04-02Paper
Improved Related-key Attacks on DESX and DESX+2009-03-23Paper
Practical Cryptanalysis of SFLASH2009-03-10Paper
Bug Attacks2009-02-10Paper
SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags2008-09-18Paper
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak2008-08-19Paper
Second Preimage Attacks on Dithered Hash Functions2008-04-15Paper
Length-based cryptanalysis: the case of Thompson's group2008-02-21Paper
Advances in Cryptology - CRYPTO 20032007-11-28Paper
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs2007-09-04Paper
Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions2007-09-04Paper
Topics in Cryptology – CT-RSA 20062007-02-12Paper
Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials2006-08-14Paper
Fast Software Encryption2006-06-22Paper
Fast Software Encryption2006-06-22Paper
https://portal.mardi4nfdi.de/entity/Q33749242006-03-01Paper
https://portal.mardi4nfdi.de/entity/Q33748972006-03-01Paper
Fast Software Encryption2005-12-27Paper
Selected Areas in Cryptography2005-12-27Paper
Cryptographic Hardware and Embedded Systems - CHES 20042005-08-23Paper
Stream Ciphers: Dead or Alive?2005-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48175122004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q47395192004-08-12Paper
A Practical Attack on Broadcast RC42004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47364172004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44741992004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44257332003-09-11Paper
https://portal.mardi4nfdi.de/entity/Q44185462003-08-10Paper
Analysis of Neural Cryptography2003-07-16Paper
Analysis of Bernstein’s Factorization Circuit2003-07-16Paper
https://portal.mardi4nfdi.de/entity/Q44091092003-06-30Paper
https://portal.mardi4nfdi.de/entity/Q47977922003-03-09Paper
Guaranteeing the diversity of number generators2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47837352002-12-08Paper
https://portal.mardi4nfdi.de/entity/Q45362082002-11-28Paper
https://portal.mardi4nfdi.de/entity/Q45379792002-10-13Paper
https://portal.mardi4nfdi.de/entity/Q49411922002-05-05Paper
https://portal.mardi4nfdi.de/entity/Q27788592002-03-21Paper
https://portal.mardi4nfdi.de/entity/Q27073962001-07-03Paper
https://portal.mardi4nfdi.de/entity/Q49418442000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q49418082000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42508302000-02-01Paper
https://portal.mardi4nfdi.de/entity/Q42496382000-01-10Paper
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions1999-10-28Paper
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials1999-10-05Paper
https://portal.mardi4nfdi.de/entity/Q42634331999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42493351999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q45027551999-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43645741998-05-12Paper
Fully parallelized multi-prover protocols for NEXP-time1997-12-08Paper
https://portal.mardi4nfdi.de/entity/Q43657651997-11-18Paper
https://portal.mardi4nfdi.de/entity/Q43657221997-11-18Paper
https://portal.mardi4nfdi.de/entity/Q43417271997-06-18Paper
A one-round, two-prover, zero-knowledge protocol for NP1996-04-10Paper
https://portal.mardi4nfdi.de/entity/Q43187171995-03-30Paper
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs1994-09-20Paper
IP = PSPACE1994-08-21Paper
https://portal.mardi4nfdi.de/entity/Q42795901994-05-16Paper
https://portal.mardi4nfdi.de/entity/Q42795601994-03-07Paper
Universal tests for nonuniform distributions1994-02-21Paper
https://portal.mardi4nfdi.de/entity/Q31362981993-09-19Paper
On dice and coins: Models of computation for random generation1993-08-30Paper
Differential Cryptanalysis of Feal and N-Hash1993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40357201993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40357141993-05-18Paper
Multi-oracle interactive protocols with constant space verifiers1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q32101671991-01-01Paper
Differential cryptanalysis of DES-like cryptosystems1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32101661990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47321261989-01-01Paper
How to find a battleship1989-01-01Paper
Zero-knowledge proofs of identity1988-01-01Paper
Reconstructing Truncated Integer Variables Satisfying Linear Congruences1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42041011987-01-01Paper
How To Prove Yourself: Practical Solutions to Identification and Signature Problems1987-01-01Paper
Efficient Factoring Based on Partial Information1986-01-01Paper
Polymorphic arrays: A novel VLSI layout for systolic computers1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37315121986-01-01Paper
Number-theoretic functions which are equivalent to number of divisors1985-01-01Paper
Generalized 'write-once' memories1984-01-01Paper
A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33329231983-01-01Paper
Embedding cryptographic trapdoors in arbitrary knapsack systems1983-01-01Paper
How to reuse a “write-once≓ memory1982-01-01Paper
A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39124811981-01-01Paper
On the power of commutativity in cryptography1980-01-01Paper
On the security of the Merkle- Hellman cryptographic scheme (Corresp.)1980-01-01Paper
How to share a secret1979-01-01Paper
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs1979-01-01Paper
Factoring numbers in O(log n) arithmetic steps1979-01-01Paper
A method for obtaining digital signatures and public-key cryptosystems1978-01-01Paper
The convergence of functions to fixedpoints of recursive definitions1978-01-01Paper
The optimal approach to recursive programs1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41243121977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38567651976-01-01Paper
On the Complexity of Timetable and Multicommodity Flow Problems1976-01-01Paper
The Theoretical Aspects of the Optimal Fixedpoint1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41403551975-01-01Paper

Research outcomes over time

This page was built for person: Adi Shamir