1 option
Cryptography and Lattices : International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001. Revised Papers / edited by Joseph H. Silverman.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2146.
- Lecture Notes in Computer Science, 0302-9743 ; 2146
- Language:
- English
- Subjects (All):
- Data encryption (Computer science).
- Computers.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Cryptology.
- Computation by Abstract Devices.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Cryptology.
- Computation by Abstract Devices.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Symbolic and Algebraic Manipulation.
- Algorithms.
- Physical Description:
- 1 online resource (VIII, 224 pages).
- Edition:
- First edition 2001.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-44670-5
- 9783540446705
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.