Cryptography and Lattices International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001. Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Silverman, Joseph H. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2146
• Θέματα: Data encryption (Computer science).; Computers.; Algorithms.; Computer science-Mathematics.; Cryptology.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Symbolic and Algebraic Manipulation.

Πίνακας περιεχομένων:

• 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.