FEEDBACK Smiley face
Normal view MARC view ISBD view

Cryptography and Lattices [electronic resource] :International Conference, CaLC 2001 Providence, RI, USA, March 29–30, 2001 Revised Papers /

Contributor(s): Silverman, Joseph H [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2146Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2001.Description: VIII, 224 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540446705.Subject(s): Computer science | Data encryption (Computer science) | Computers | Algorithms | 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 | AlgorithmsOnline resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in