Abstract is missing.
- An Overview of the Sieve Algorithm for the Shortest Lattice Vector ProblemMiklós Ajtai, Ravi Kumar, D. Sivakumar. 1-3 [doi]
- Low Secret Exponent RSA RevisitedJohannes Blömer, Alexander May. 4-19 [doi]
- Finding Small Solutions to Small Degree PolynomialsDon Coppersmith. 20-31 [doi]
- Fast Reduction of Ternary Quadratic FormsFriedrich Eisenbrand, Günter Rote. 32-44 [doi]
- Factoring Polynomials and 0-1 VectorsMark van Hoeij. 45-50 [doi]
- Approximate Integer Common DivisorsNick Howgrave-Graham. 51-66 [doi]
- Segment LLL-Reduction of Lattice BasesHenrik Koy, Claus-Peter Schnorr. 67-80 [doi]
- Segment LLL-Reduction with Floating Point OrthogonalizationHenrik Koy, Claus-Peter Schnorr. 81-96 [doi]
- The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known NoncesEdwin El Mahassni, Phong Q. Nguyen, Igor Shparlinski. 97-109 [doi]
- Dimension Reduction Methods for Convolution Modular LatticesAlexander May, Joseph H. Silverman. 110-125 [doi]
- Improving Lattice Based Cryptosystems Using the Hermite Normal FormDaniele Micciancio. 126-145 [doi]
- The Two Faces of Lattices in CryptologyPhong Q. Nguyen, Jacques Stern. 146-180 [doi]
- A 3-Dimensional Lattice Reduction AlgorithmIgor A. Semaev. 181-193 [doi]
- The Shortest Vector Problem in Lattices with Many CyclesMårten Trolin. 194-205 [doi]
- Multisequence Synthesis over an Integral DomainLi-Ping Wang, Yue-fei Zhu. 206-218 [doi]