An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem.- Low Secret Exponent RSA Revisited.- Finding Small Solutions to Small Degree Polynomials.- Fast Reduction of Ternary Quadratic Forms.- Factoring Polynomials and 0-1 Vectors.- Approximate Integer Common Divisors.- Segment LLL-Reduction of Lattice Bases.- Segment LLL-Reduction with Floating Point Orthogonalization.- The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces.- Dimension Reduction Methods for Convolution Modular Lattices.- Improving Lattice Based Cryptosystems Using the Hermite Normal Form.- The Two Faces of Lattices in Cryptology.- A 3-Dimensional Lattice Reduction Algorithm.- The Shortest Vector Problem in Lattices with Many Cycles.- Multisequence Synthesis over an Integral Domain.

This book constitutes the thoroughly refereed post-proceedings of the International Conference on Cryptography and Lattices, CaLC 2001, held in Providence, RI, USA in March 2001. The 14 revised full papers presented together with an overview paper were carefully reviewed and selected for inclusion in the book. All current aspects of lattices and lattice reduction in cryptography, both for cryptographic construction and cryptographic analysis, are addressed.