product iamge

Cryptography and Lattices: International Conference, CaLC 2001 Providence, RI, USA, March 29–30, 2001 Revised Papers

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Miklós Ajtai, Ravi Kumar, Dandapani Sivakumar (auth.), Joseph H. Silverman (eds.)
Series: Lecture Notes in Computer Science 2146
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001

Language: English
Pages: 224
Tags: Data Encryption; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Symbolic and Algebraic Manipulation; Algorithms

An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem....Pages 1-3
Low Secret Exponent RSA Revisited....Pages 4-19
Finding Small Solutions to Small Degree Polynomials....Pages 20-31
Fast Reduction of Ternary Quadratic Forms....Pages 32-44
Factoring Polynomials and 0—1 Vectors....Pages 45-50
Approximate Integer Common Divisors....Pages 51-66
Segment LLL-Reduction of Lattice Bases....Pages 67-80
Segment LLL-Reduction with Floating Point Orthogonalization....Pages 81-96
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces....Pages 97-109
Dimension Reduction Methods for Convolution Modular Lattices....Pages 110-125
Improving Lattice Based Cryptosystems Using the Hermite Normal Form....Pages 126-145
The Two Faces of Lattices in Cryptology....Pages 146-180
A 3-Dimensional Lattice Reduction Algorithm....Pages 181-193
The Shortest Vector Problem in Lattices with Many Cycles....Pages 194-205
Multisequence Synthesis over an Integral Domain....Pages 206-217