Search the dblp DataBase
Adi Shamir :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Ronald L. Rivest , Adi Shamir , Leonard M. Adleman A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. [Citation Graph (7, 0)][DBLP ] Commun. ACM, 1978, v:21, n:2, pp:120-126 [Journal ] Shimon Even , Alon Itai , Adi Shamir On the Complexity of Timetable and Multicommodity Flow Problems. [Citation Graph (2, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:4, pp:691-703 [Journal ] Adi Shamir Identity-Based Cryptosystems and Signature Schemes. [Citation Graph (1, 0)][DBLP ] CRYPTO, 1984, pp:47-53 [Conf ] Adi Shamir How to Share a Secret. [Citation Graph (1, 0)][DBLP ] Commun. ACM, 1979, v:22, n:11, pp:612-613 [Journal ] Ronald L. Rivest , Adi Shamir How to Reuse a ``Write-Once'' Memory [Citation Graph (1, 0)][DBLP ] Information and Control, 1982, v:55, n:1-3, pp:1-19 [Journal ] Alex Biryukov , Adi Shamir Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2000, pp:1-13 [Conf ] Alexander Klimov , Anton Mityagin , Adi Shamir Analysis of Neural Cryptography. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2002, pp:288-298 [Conf ] Arjen K. Lenstra , Adi Shamir , Jim Tomlinson , Eran Tromer Analysis of Bernstein's Factorization Circuit. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2002, pp:1-26 [Conf ] Arjen K. Lenstra , Eran Tromer , Adi Shamir , Wil Kortsmit , Bruce Dodson , James Hughes , Paul C. Leyland Factoring Estimates for a 1024-Bit RSA Modulus. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2003, pp:55-74 [Conf ] Ronald L. Rivest , Adi Shamir , Yael Tauman How to Leak a Secret. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2001, pp:552-565 [Conf ] Adi Shamir Stream Ciphers: Dead or Alive? [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2004, pp:78- [Conf ] Ronald L. Rivest , Adi Shamir , Yael Tauman How to Leak a Secret: Theory and Applications of Ring Signatures. [Citation Graph (0, 0)][DBLP ] Essays in Memory of Shimon Even, 2006, pp:164-186 [Conf ] Jonathan J. Hoch , Adi Shamir Fault Analysis of Stream Ciphers. [Citation Graph (0, 0)][DBLP ] CHES, 2004, pp:240-253 [Conf ] Alexander Klimov , Adi Shamir A New Class of Invertible Mappings. [Citation Graph (0, 0)][DBLP ] CHES, 2002, pp:470-483 [Conf ] Willi Geiselmann , Adi Shamir , Rainer Steinwandt , Eran Tromer Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization. [Citation Graph (0, 0)][DBLP ] CHES, 2005, pp:131-146 [Conf ] Adi Shamir Protecting Smart Cards from Passive Power Analysis with Detached Power Supplies. [Citation Graph (0, 0)][DBLP ] CHES, 2000, pp:71-77 [Conf ] Adi Shamir New Directions in Croptography. [Citation Graph (0, 0)][DBLP ] CHES, 2001, pp:159- [Conf ] Adi Shamir Factoring Large Numbers with the Twinkle Device (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CHES, 1999, pp:2-12 [Conf ] Uriel Feige , Adi Shamir Multi-Oracle Interactive Protocols with Space Bounded Verifiers. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1989, pp:158-164 [Conf ] Eli Biham , Adi Shamir Differential Fault Analysis of Secret Key Cryptosystems. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1997, pp:513-525 [Conf ] Eli Biham , Adi Shamir Differential Cryptanalysis of DES-like Cryptosystems. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1990, pp:2-21 [Conf ] Eli Biham , Adi Shamir Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1991, pp:156-171 [Conf ] Eli Biham , Adi Shamir Differential Cryptanalysis of the Full 16-Round DES. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1992, pp:487-496 [Conf ] Shimon Even , Oded Goldreich , Adi Shamir On the Security of Ping-Pong Protocols when Implemented using the RSA. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1985, pp:58-72 [Conf ] Uriel Feige , Adi Shamir Zero Knowledge Proofs of Knowledge in Two Rounds. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1989, pp:526-544 [Conf ] Uriel Feige , Adi Shamir , Moshe Tennenholtz The Noisy Oracle Problem. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1988, pp:284-296 [Conf ] Amos Fiat , Adi Shamir How to Prove Yourself: Practical Solutions to Identification and Signature Problems. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1986, pp:186-194 [Conf ] Dani Halevy , Adi Shamir The LSD Broadcast Encryption Scheme. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2002, pp:47-60 [Conf ] Aviad Kipnis , Adi Shamir Cryptanalysis of the Oil & Vinegar Signature Scheme. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1998, pp:257-266 [Conf ] Aviad Kipnis , Adi Shamir Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1999, pp:19-30 [Conf ] Silvio Micali , Adi Shamir An Improvement of the Fiat-Shamir Identification and Signature Scheme. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1988, pp:244-247 [Conf ] Dror Lapidot , Adi Shamir Publicly Verifiable Non-Interactive Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1990, pp:353-365 [Conf ] Dror Lapidot , Adi Shamir A One-Round, Two-Prover, Zero-Knowledge Protocol for NP. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1991, pp:213-224 [Conf ] Yossi Matias , Adi Shamir A Video Scrambling Technique Based On Space Filling Curves. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1987, pp:398-417 [Conf ] H. Ong , Claus-Peter Schnorr , Adi Shamir Efficient Signature Schemes Based on Polynomial Equations. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1984, pp:37-46 [Conf ] Adi Shamir The Generation of Cryptographically Strong Pseudo-Random Sequences. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1981, pp:1- [Conf ] Adi Shamir A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1982, pp:279-288 [Conf ] Adi Shamir On the Security of DES. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1985, pp:280-281 [Conf ] Adi Shamir An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CRYPTO, 1989, pp:606-609 [Conf ] Adi Shamir Efficient Signature Schemes Based on Birational Permutations. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1993, pp:1-12 [Conf ] Adi Shamir , Yael Tauman Improved Online/Offline Signature Schemes. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2001, pp:355-367 [Conf ] Adi Shamir , Eran Tromer Factoring Large Number with the TWIRL Device. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2003, pp:1-26 [Conf ] Elad Barkan , Eli Biham , Adi Shamir Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:1-21 [Conf ] Dag Arne Osvik , Adi Shamir , Eran Tromer Cache Attacks and Countermeasures: The Case of AES. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2006, pp:1-20 [Conf ] Adi Shamir RSA Shortcuts. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2003, pp:327- [Conf ] Eli Biham , Alex Biryukov , Adi Shamir Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1999, pp:12-23 [Conf ] Eli Biham , Adi Shamir Differential Cryptoanalysis of Feal and N-Hash. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1991, pp:1-16 [Conf ] Alex Biryukov , Adi Shamir Structural Cryptanalysis of SASAS. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2001, pp:394-405 [Conf ] Don Coppersmith , Adi Shamir Lattice Attacks on NTRU. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1997, pp:52-61 [Conf ] Nicolas Courtois , Alexander Klimov , Jacques Patarin , Adi Shamir Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2000, pp:392-407 [Conf ] Arjen K. Lenstra , Adi Shamir Analysis and Optimization of the TWINKLE Factoring Device. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2000, pp:35-52 [Conf ] Moni Naor , Adi Shamir Visual Cryptography. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1994, pp:1-12 [Conf ] Adi Shamir Memory Efficient Variants of Public-Key Schemes for Smart Card Applications. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1994, pp:445-449 [Conf ] Adi Shamir Visual Cryptanalysis. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1998, pp:201-210 [Conf ] Ronald L. Rivest , Adi Shamir Efficient Factoring Based on Partial Information. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1985, pp:31-34 [Conf ] Adi Shamir SecureClick: A Web Payment System with Disposable Credit Card Numbers. [Citation Graph (0, 0)][DBLP ] Financial Cryptography, 2001, pp:223-233 [Conf ] Adi Shamir , Nicko van Someren Playing "Hide and Seek" with Stored Keys. [Citation Graph (0, 0)][DBLP ] Financial Cryptography, 1999, pp:118-124 [Conf ] Shimon Even , Alon Itai , Adi Shamir On the Complexity of Timetable and Multi-Commodity Flow Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1975, pp:184-193 [Conf ] Uriel Feige , Dror Lapidot , Adi Shamir Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:308-317 [Conf ] Amos Fiat , Shahar Moses , Adi Shamir , Ilan Shimshoni , Gábor Tardos Planning and Learning in Permutation Groups [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:274-279 [Conf ] Amos Fiat , Adi Shamir Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers [Citation Graph (0, 0)][DBLP ] FOCS, 1984, pp:37-45 [Conf ] Dror Lapidot , Adi Shamir Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:13-18 [Conf ] Richard Schroeppel , Adi Shamir A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1979, pp:328-336 [Conf ] Adi Shamir A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem [Citation Graph (0, 0)][DBLP ] FOCS, 1982, pp:145-152 [Conf ] Adi Shamir IP=PSPACE [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:11-15 [Conf ] Eli Biham , Alex Biryukov , Adi Shamir Miss in the Middle Attacks on IDEA and Khufu. [Citation Graph (0, 0)][DBLP ] Fast Software Encryption, 1999, pp:124-138 [Conf ] Alex Biryukov , Adi Shamir Analysis of the Non-linear Part of Mugi. [Citation Graph (0, 0)][DBLP ] FSE, 2005, pp:320-329 [Conf ] Alex Biryukov , Adi Shamir , David Wagner Real Time Cryptanalysis of A5/1 on a PC. [Citation Graph (0, 0)][DBLP ] FSE, 2000, pp:1-18 [Conf ] Alexander Klimov , Adi Shamir New Cryptographic Primitives Based on Multiword T-Functions. [Citation Graph (0, 0)][DBLP ] FSE, 2004, pp:1-15 [Conf ] Alexander Klimov , Adi Shamir New Applications of T-Functions in Block Ciphers and Hash Functions. [Citation Graph (0, 0)][DBLP ] FSE, 2005, pp:18-31 [Conf ] Itsik Mantin , Adi Shamir A Practical Attack on Broadcast RC4. [Citation Graph (0, 0)][DBLP ] FSE, 2001, pp:152-164 [Conf ] Jonathan J. Hoch , Adi Shamir Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions. [Citation Graph (0, 0)][DBLP ] FSE, 2006, pp:179-194 [Conf ] David Feldman , Russell Impagliazzo , Moni Naor , Noam Nisan , Steven Rudich , Adi Shamir On Dice and Coins: Models of Computation for Random Generation. [Citation Graph (0, 0)][DBLP ] ICALP, 1989, pp:319-340 [Conf ] Adi Shamir On the Power of Commutativity in Cryptography. [Citation Graph (0, 0)][DBLP ] ICALP, 1980, pp:582-595 [Conf ] Adi Shamir On the Generation of Cryptographically Strong Pseudo-Random Sequences. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:544-550 [Conf ] Adi Shamir , William W. Wadge Data Types as Objects. [Citation Graph (0, 0)][DBLP ] ICALP, 1977, pp:465-479 [Conf ] Amos Fiat , Adi Shamir , Ehud Y. Shapiro Polymorphic Arrays: An Architecture for a Programmable Systolic Machine. [Citation Graph (0, 0)][DBLP ] ICPP, 1985, pp:112-117 [Conf ] Sandeep Sen , Isaac D. Scherson , Adi Shamir Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks. [Citation Graph (0, 0)][DBLP ] ICPP, 1986, pp:903-908 [Conf ] Ross J. Anderson , Roger M. Needham , Adi Shamir The Steganographic File System. [Citation Graph (0, 0)][DBLP ] Information Hiding, 1998, pp:73-82 [Conf ] Adi Shamir Practical Cryptography - Recent Trends and Results. [Citation Graph (0, 0)][DBLP ] ISTCS, 1993, pp:127- [Conf ] David Naccache , Adi Shamir , Julien P. Stern How to Copyright a Function? [Citation Graph (0, 0)][DBLP ] Public Key Cryptography, 1999, pp:188-196 [Conf ] Eli Biham , Alex Biryukov , Orr Dunkelman , Eran Richardson , Adi Shamir Initial Observations on Skipjack: Cryptanalysis of Skipjack-3XOR. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 1998, pp:362-376 [Conf ] Alexander Klimov , Adi Shamir Cryptographic Applications of T-Functions. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2003, pp:248-261 [Conf ] Scott R. Fluhrer , Itsik Mantin , Adi Shamir Weaknesses in the Key Scheduling Algorithm of RC4. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2001, pp:1-24 [Conf ] Adi Shamir The Cryptographic Security of Compact Knapsacks (Preliminary Report). [Citation Graph (0, 0)][DBLP ] IEEE Symposium on Security and Privacy, 1980, pp:94-99 [Conf ] Moni Naor , Adi Shamir Visual Cryptography II: Improving the Contrast Via the Cover Base. [Citation Graph (0, 0)][DBLP ] Security Protocols Workshop, 1996, pp:197-202 [Conf ] Ronald L. Rivest , Adi Shamir PayWord and MicroMint: Two Simple Micropayment Schemes. [Citation Graph (0, 0)][DBLP ] Security Protocols Workshop, 1996, pp:69-87 [Conf ] Michael Ben-Or , Benny Chor , Adi Shamir On the Cryptographic Security of Single RSA Bits [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:421-430 [Conf ] Uriel Feige , Amos Fiat , Adi Shamir Zero Knowledge Proofs of Identity [Citation Graph (0, 0)][DBLP ] STOC, 1987, pp:210-217 [Conf ] Uriel Feige , Adi Shamir Witness Indistinguishable and Witness Hiding Protocols [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:416-426 [Conf ] Johan Håstad , Adi Shamir The Cryptographic Security of Truncated Linearly Related Variables [Citation Graph (0, 0)][DBLP ] STOC, 1985, pp:356-362 [Conf ] Zohar Manna , Adi Shamir The Optimal Fixedpoint of Recursive Programs [Citation Graph (0, 0)][DBLP ] STOC, 1975, pp:194-206 [Conf ] H. Ong , Claus-Peter Schnorr , Adi Shamir An Efficient Signature Scheme Based on Quadratic Equations [Citation Graph (0, 0)][DBLP ] STOC, 1984, pp:208-216 [Conf ] Ronald L. Rivest , Adi Shamir How to Reuse a ``Write-Once'' Memory (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1982, pp:105-113 [Conf ] Claus-Peter Schnorr , Adi Shamir An Optimal Sorting Algorithm for Mesh Connected Computers [Citation Graph (0, 0)][DBLP ] STOC, 1986, pp:255-263 [Conf ] A. W. Schrift , Adi Shamir The Discrete Log is Very Discreet [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:405-415 [Conf ] Adi Shamir On the Cryptocomplexity of Knapsack Systems [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:118-129 [Conf ] Adi Shamir On the generation of multivariate polynomials which are hard to factor. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:796-804 [Conf ] Zohar Manna , Adi Shamir The Optimal Approach to Recursive Programs. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1977, v:20, n:11, pp:824-831 [Journal ] Ronald L. Rivest , Adi Shamir How to Expose an Eavesdropper. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1984, v:27, n:4, pp:393-395 [Journal ] Ronald L. Rivest , Adi Shamir , Leonard M. Adleman A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint). [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1983, v:26, n:1, pp:96-99 [Journal ] Dror Lapidot , Adi Shamir A One-Round, Two-Prover, Zero-Knowledge Protocol for NP. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1995, v:15, n:2, pp:204-214 [Journal ] Adi Shamir , Boaz Tsaban Guaranteeing the diversity of number generators [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] David Feldman , Russell Impagliazzo , Moni Naor , Noam Nisan , Steven Rudich , Adi Shamir On Dice and Coins: Models of Computation for Random Generation [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1993, v:104, n:2, pp:159-174 [Journal ] Adi Shamir , Boaz Tsaban Guaranteeing the Diversity of Number Generators. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:171, n:2, pp:350-363 [Journal ] Jeffrey Shallit , Adi Shamir Number-Theoretic Functions Which Are Equivalent to Number of Divisors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:3, pp:151-153 [Journal ] Adi Shamir Factoring Numbers in O(log n) Arithmetic Steps. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1979, v:8, n:1, pp:28-31 [Journal ] Adi Shamir Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1983, v:17, n:2, pp:77-79 [Journal ] Adi Shamir , Claus-Peter Schnorr Cryptanalysis of Certain Variants of Rabin's Signature Scheme. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1984, v:19, n:3, pp:113-115 [Journal ] Adi Shamir IP = PSPACE. [Citation Graph (0, 0)][DBLP ] J. ACM, 1992, v:39, n:4, pp:869-877 [Journal ] Uriel Feige , Adi Shamir Multi-Oracle Interactive Protocols with Constant Space Verifiers. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1992, v:44, n:2, pp:259-271 [Journal ] Amos Fiat , Adi Shamir Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1986, v:33, n:1, pp:47-65 [Journal ] Johan Håstad , A. W. Schrift , Adi Shamir The Discrete Logarithm Modulo a Composite Hides O(n) Bits. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1993, v:47, n:3, pp:376-404 [Journal ] Dror Lapidot , Adi Shamir Fully Parallelized Multi-Prover Protocols for NEXP-Time. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1997, v:54, n:2, pp:215-220 [Journal ] Uriel Feige , Amos Fiat , Adi Shamir Zero-Knowledge Proofs of Identity. [Citation Graph (0, 0)][DBLP ] J. Cryptology, 1988, v:1, n:2, pp:77-94 [Journal ] Eli Biham , Alex Biryukov , Adi Shamir Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials. [Citation Graph (0, 0)][DBLP ] J. Cryptology, 2005, v:18, n:4, pp:291-311 [Journal ] Eli Biham , Adi Shamir Differential Cryptanalysis of DES-like Cryptosystems. [Citation Graph (0, 0)][DBLP ] J. Cryptology, 1991, v:4, n:1, pp:3-72 [Journal ] A. W. Schrift , Adi Shamir Universal Tests for Nonuniform Distributions. [Citation Graph (0, 0)][DBLP ] J. Cryptology, 1993, v:6, n:3, pp:119-133 [Journal ] Uriel Feige , Dror Lapidot , Adi Shamir Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:29, n:1, pp:1-28 [Journal ] Alan M. Frieze , Johan Håstad , Ravi Kannan , J. C. Lagarias , Adi Shamir Reconstructing Truncated Integer Variables Satisfying Linear Congruences. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:2, pp:262-280 [Journal ] Zohar Manna , Adi Shamir The Theoretical Aspects of the Optimal Fixed Point. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:3, pp:414-426 [Journal ] Richard Schroeppel , Adi Shamir A T=O(2^(n/2)), S=O(2^(n/4)) Algorithm for Certain NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:3, pp:456-464 [Journal ] Adi Shamir A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1979, v:8, n:4, pp:645-655 [Journal ] Zohar Manna , Adi Shamir The Convergence of Functions to Fixedpoints of Recursive Definitions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1978, v:6, n:, pp:109-141 [Journal ] Amos Fiat , Adi Shamir Generalized 'write-once' memories. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1984, v:30, n:3, pp:470-479 [Journal ] Adi Shamir A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:699-704 [Journal ] Adi Shamir On the Generation of Cryptographically Strong Pseudorandom Sequences [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Syst., 1983, v:1, n:1, pp:38-44 [Journal ] Vivien Dubois , Pierre-Alain Fouque , Adi Shamir , Jacques Stern Practical Cryptanalysis of SFLASH. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2007, pp:1-12 [Conf ] Dima Ruinskiy , Adi Shamir , Boaz Tsaban Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions. [Citation Graph (0, 0)][DBLP ] Public Key Cryptography, 2007, pp:61-75 [Conf ] Dima Ruinskiy , Adi Shamir , Boaz Tsaban Cryptanalysis of group-based key agreement protocols using subgroup distance functions [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Dima Ruinskiy , Adi Shamir , Boaz Tsaban Length-based cryptanalysis: The case of Thompson's Group [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Yossef Oren , Adi Shamir Remote Password Extraction from RFID Tags. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2007, v:56, n:9, pp:1292-1296 [Journal ] RSA-Past, Present, Future. [Citation Graph (, )][DBLP ] Collision-Based Power Analysis of Modular Exponentiation Using Chosen-Message Pairs. [Citation Graph (, )][DBLP ] Fast Exhaustive Search for Polynomial Systems in F 2 . [Citation Graph (, )][DBLP ] Cryptanalysis of the SFLASH Signature Scheme. [Citation Graph (, )][DBLP ] Bug Attacks. [Citation Graph (, )][DBLP ] A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony. [Citation Graph (, )][DBLP ] Second Preimage Attacks on Dithered Hash Functions. [Citation Graph (, )][DBLP ] Cube Attacks on Tweakable Black Box Polynomials. [Citation Graph (, )][DBLP ] Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds. [Citation Graph (, )][DBLP ] SQUASH - A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags. [Citation Graph (, )][DBLP ] Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium. [Citation Graph (, )][DBLP ] On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak. [Citation Graph (, )][DBLP ] RFID Authentication, Efficient Proactive Information Security within Computational Security [Citation Graph (, )][DBLP ] Search in 0.012secs, Finished in 0.019secs