Cryptography and lattices : international conference, CaLC 2001, Providence RI, USA, March 29-30, 2001 : revised papers
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2146 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Cryptography and lattices, international conference, CaLC 2001, Providence RI, USA, March 29-30, 2001, revised papers, Joseph H. Silverman (ed.), 2001, New York, Springer, 1 vol. (VI-217 p.), Lecture notes in computer science, 3-540-42488-1 • Cryptography and Lattices, Texte imprimé, 9783662176566 |
Taula de continguts:
- 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.