CaLC 2001: Providence, RI, USA
Joseph H. Silverman (Ed.): Cryptography and Lattices, International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001, Revised Papers. Springer 2001 Lecture Notes in Computer Science ISBN 3-540-42488-1- Miklós Ajtai, Ravi Kumar, D. Sivakumar: An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. 1-3
- Don Coppersmith: Finding Small Solutions to Small Degree Polynomials. 20-31
- Mark van Hoeij: Factoring Polynomials and 0-1 Vectors. 45-50
- Nick Howgrave-Graham: Approximate Integer Common Divisors. 51-66
- Edwin El Mahassni, Phong Q. Nguyen, Igor Shparlinski: The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces. 97-109
- Alexander May, Joseph H. Silverman: Dimension Reduction Methods for Convolution Modular Lattices. 110-125
- Daniele Micciancio: Improving Lattice Based Cryptosystems Using the Hermite Normal Form. 126-145
- Igor A. Semaev: A 3-Dimensional Lattice Reduction Algorithm. 181-193
- Mårten Trolin: The Shortest Vector Problem in Lattices with Many Cycles. 194-205
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team