E. F. Brickell. Breaking iterated knapsacks. In G. R. Blakley and D. Chaum, editors, Advances in cryptology - Proceedings of CRYPTO '84, volume 196 of Lecture Notes in Computer Science, pages 342-358, Santa Barbara, California, USA, Aug. 1984. Springer-Verlag. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
The Two Faces of Lattices in Cryptology - Nguyen, Stern (2001) (7 citations) (Correct)
Lattices and Cryptography: an Overview - Stern (1998) (2 citations) (Correct)
Lattice Reduction: a Toolbox for the Cryptanalyst - Joux, Stern (1994) (20 citations) (Correct)
Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000) (12 citations) (Correct)
New Public-key Cryptosystem Using Braid Groups - Ko, Lee, Cheon, Han, Kang, Park (26 citations) (Correct)
Cryptology - Rivest (Correct)
Analysis of a Subset Sum Randomizer - Gemmell, Johnston (2001) (Correct)
Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000) (12 citations) (Correct)
Cryptanalysis of the Ajtai-Dwork Cryptosystem - Nguyen, Stern (1998) (6 citations) (Correct)
Lattice Reduction: a Toolbox for the Cryptanalyst - Joux, Stern (1994) (20 citations) (Correct)
Generating Hard Instances of Lattice Problems (Extended Abstract) - Ajtai (1996) (Correct)
Cryptology - Rivest (1990) (Correct)
Stream Ciphers - Robshaw (1995) (1 citation) (Correct)
The Rise and Fall of Knapsack Cryptosystems - Odlyzko (1990) (14 citations) (Correct)
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient.. - Micciancio (2004) (Correct)
Density Attack on the Knapsack Cryptosystems - With Enumerative Source (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC