Cryptography and Lattices

International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001. Revised Papers

232 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• Themen: Lexika Forschung und Information, allgemein Kodierungstheorie und Verschlüsselung (Kryptologie)
• ISBN: 9783540424888
• Sprache: Englisch
• Erscheinungsdatum: 15.08.2001
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: Joseph H. Silverman