FEEDBACK Smiley face
Cryptography and Lattices International Conference, CaLC 2001 Providence, RI, USA, March 29–30, 2001 Revised Papers / [electronic resource] : edited by Joseph H. Silverman. - VIII, 224 p. online resource. - Lecture Notes in Computer Science, 2146 0302-9743 ; . - Lecture Notes in Computer Science, 2146 .

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.


10.1007/3-540-44670-2 doi

Computer science.
Data encryption (Computer science).
Computer science--Mathematics.
Computer Science.
Data Encryption.
Computation by Abstract Devices.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Symbolic and Algebraic Manipulation.



© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: