Buch, Englisch, Band 2146, 224 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 359 g
International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001. Revised Papers
Buch, Englisch, Band 2146, 224 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 359 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-42488-8
Verlag: Springer Berlin Heidelberg
Secret Exponent RSA Revisited: 4 Johannes Bl¨ omer and Alexander May Finding Small Solutions to Small Degree Polynomials: 20 Don Coppersmith Fast Reduction of Ternary Quadratic Forms: 32 Friedrich Eisenbrand and Gunt ¨ er Rote Factoring Polynomialsand 0-1 Vectors: 45 Mark van Hoeij Approximate Integer Common Divisors: 51 Nick Howgrave-Graham Segment LLL-Reduction of Lattice Bases: 67 Henrik Koy and Claus Peter Schnorr Segment LLL-Reduction with Floating Point Orthogonalization: 81 Henrik Koy and Claus Peter Schnorr TheInsecurity ofNyberg-Rueppel andOther DSA-LikeSignatureSchemes with Partially Known Nonces: 97 Edwin El Mahassni, Phong Q. Nguyen, and Igor E. Shparlinski Dimension Reduction Methods for Convolution Modular Lattices: 110 Alexander May and Joseph H. Silverman Improving Lattice Based Cryptosystems Using the Hermite Normal Form: 126 Daniele Micciancio The Two Faces of Lattices in Cryptology: 146 Phong Q.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Kryptologie, Informationssicherheit
- Mathematik | Informatik Mathematik Mathematik Interdisziplinär Computeralgebra
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Technische Informatik Computersicherheit Kryptographie, Datenverschlüsselung
Weitere Infos & Material
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.
