The following pages link to Adi Shamir (Q321301):
Displayed 50 items.
- New second-preimage attacks on hash functions (Q321303) (← links)
- Key recovery attacks on iterated Even-Mansour encryption schemes (Q321305) (← links)
- Bug attacks (Q321310) (← links)
- A practical-time related-key attack on the \texttt{KASUMI} cryptosystem used in GSM and 3G telephony (Q484333) (← links)
- Almost universal forgery attacks on AES-based MAC's (Q494579) (← links)
- Embedding cryptographic trapdoors in arbitrary knapsack systems (Q595612) (← links)
- Structural cryptanalysis of SASAS (Q604629) (← links)
- Improved practical attacks on round-reduced Keccak (Q744599) (← links)
- Differential cryptanalysis of DES-like cryptosystems (Q807011) (← links)
- Reflections on slide with a twist attacks (Q887444) (← links)
- Number-theoretic functions which are equivalent to number of divisors (Q1064776) (← links)
- Polymorphic arrays: A novel VLSI layout for systolic computers (Q1088396) (← links)
- Zero-knowledge proofs of identity (Q1112785) (← links)
- Multi-oracle interactive protocols with constant space verifiers (Q1190986) (← links)
- The convergence of functions to fixedpoints of recursive definitions (Q1254993) (← links)
- Factoring numbers in O(log n) arithmetic steps (Q1255313) (← links)
- (Q1310448) (redirect page) (← links)
- Universal tests for nonuniform distributions (Q1310449) (← links)
- Fully parallelized multi-prover protocols for NEXP-time (Q1356878) (← links)
- How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs (Q1688404) (← links)
- Guaranteeing the diversity of number generators (Q1854489) (← links)
- A one-round, two-prover, zero-knowledge protocol for NP (Q1894702) (← links)
- Efficient dissection of bicomposite problems with cryptanalytic applications (Q2010595) (← links)
- Slidex attacks on the Even-Mansour encryption scheme (Q2018815) (← links)
- New slide attacks on almost self-similar ciphers (Q2055611) (← links)
- The retracing boomerang attack (Q2055612) (← links)
- Three third generation attacks on the format preserving encryption scheme FF3 (Q2056726) (← links)
- Efficient cache attacks on AES, and countermeasures (Q2267358) (← links)
- New attacks on IDEA with at least 6 rounds (Q2344046) (← links)
- On dice and coins: Models of computation for random generation (Q2366558) (← links)
- Applying cube attacks to stream ciphers in realistic scenarios (Q2376659) (← links)
- Acoustic cryptanalysis (Q2397444) (← links)
- RFID authentication efficient proactive information security within computational security (Q2429725) (← links)
- Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials (Q2499261) (← links)
- Improved single-key attacks on 8-round AES-192 and AES-256 (Q2516521) (← links)
- (Q2707396) (← links)
- (Q2778859) (← links)
- Memory-Efficient Algorithms for Finding Needles in Haystacks (Q2829215) (← links)
- Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2 (Q2867226) (← links)
- RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis (Q2874519) (← links)
- How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGs (Q2874529) (← links)
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited (Q2894417) (← links)
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems (Q2914297) (← links)
- Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys (Q2938858) (← links)
- Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions (Q2945385) (← links)
- Improved Top-Down Techniques in Differential Cryptanalysis (Q2946446) (← links)
- Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials (Q2946880) (← links)
- Improved Linear Sieving Techniques with Applications to Step-Reduced LED-64 (Q2946920) (← links)
- Identity-Based Cryptosystems and Signature Schemes (Q2974478) (← links)
- An Improved Algebraic Attack on Hamsi-256 (Q3013079) (← links)