Cryptography and Lattices [electronic resource] : International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001. Revised Papers /
Material type: TextSeries: Lecture Notes in Computer Science ; 2146Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001Edition: 1st ed. 2001Description: VIII, 224 p. online resourceContent type:- text
- computer
- online resource
- 9783540446705
- 005.824 23
- QA268
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 on this title.