


default search action
CaLC 2001: Providence, RI, USA
- Joseph H. Silverman:
Cryptography and Lattices, International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001, Revised Papers. Lecture Notes in Computer Science 2146, Springer 2001, ISBN 3-540-42488-1 - Miklós Ajtai, Ravi Kumar, D. Sivakumar:
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. 1-3 - Johannes Blömer, Alexander May
:
Low Secret Exponent RSA Revisited. 4-19 - Don Coppersmith:
Finding Small Solutions to Small Degree Polynomials. 20-31 - Friedrich Eisenbrand, Günter Rote:
Fast Reduction of Ternary Quadratic Forms. 32-44 - Mark van Hoeij:
Factoring Polynomials and 0-1 Vectors. 45-50 - Nick Howgrave-Graham:
Approximate Integer Common Divisors. 51-66 - Henrik Koy, Claus-Peter Schnorr:
Segment LLL-Reduction of Lattice Bases. 67-80 - Henrik Koy, Claus-Peter Schnorr:
Segment LLL-Reduction with Floating Point Orthogonalization. 81-96 - Edwin El Mahassni, Phong Q. Nguyen, Igor E. Shparlinski
:
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces. 97-109 - Alexander May
, Joseph H. Silverman:
Dimension Reduction Methods for Convolution Modular Lattices. 110-125 - Daniele Micciancio
:
Improving Lattice Based Cryptosystems Using the Hermite Normal Form. 126-145 - Phong Q. Nguyen, Jacques Stern:
The Two Faces of Lattices in Cryptology. 146-180 - Igor A. Semaev:
A 3-Dimensional Lattice Reduction Algorithm. 181-193 - Mårten Trolin:
The Shortest Vector Problem in Lattices with Many Cycles. 194-205 - Liping Wang, Yue-fei Zhu:
Multisequence Synthesis over an Integral Domain. 206-218

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.