Cryptography
and Lattices
Conference 2001

Schedule of Talks and Events

Cryptography and Lattices Conference (CaLC 2001)
Brown University, Providence, RI, USA
March 29-30, 2001

All talks will take place in MacMillan Hall, Room 115
(corner of George and Thayer Streets)

Thursday, March 29

8:00-9:00 AM
Registration and Light Breakfast

9:00-9:15 AM
Introductory Remarks

9:15-10:15 AM
The two faces of lattices in cryptology
Phong Nguyen (ENS)

10:30-11:00 AM
Segment LLL-Reduction of Lattice Bases
Henrik Koy and Claus Peter Schnorr (Deutsche Bank, University of Frankfurt)

11:00-11:30 AM
Segment LLL-Reduction with Floating Point Orthogonalization
Henrik Koy and Claus Peter Schnorr (Deutsche Bank, University of Frankfurt)

11:30-12:00 AM
The shortest vector problem in lattices with many cycles
Marten Trolin (Royal Institute of Technology, Stockholm)

12:00-2:00 PM
Lunch Break

2:00-3:00 PM
Finding Small Solutions to Small Degree Polynomials
Don Coppersmith (IBM)

3:00-3:30 PM
Low secret exponent RSA revisited
Johannes Blomer and Alexander May (University of Paderborn)

3:30-4:00 PM
Refreshment Break

4:00-4:30 PM
Approximate integer common divisors
Nick Howgrave-Graham (IBM)

4:30-5:00 PM
Multisequence synthesis over an integral domain
Li-Ping Wang and Yue-Fei Zhu (USTC Beijing, IEU Zhengzhou)

6:00-9:00 PM
Banquet at the Gatehouse Restaurant

Friday, March 30

8:30-9:15 AM
Light Breakfast

9:15-10:15 AM
A Sieve Algorithm for the Shortest Lattice Vector Problem
Ravi Kumar (IBM)

10:30-11:00 AM
Fast reduction of ternary quadratic forms
Friedrich Eisenbrand and Gunter Rote (Max Planck Institute Saarbrucken, Freie Universitat Berlin))

11:00-11:30 AM
A 3-dimensional lattice reduction algorithm
Igor Semaev (Moscow State University)

11:30-12:00 AM
The insecurity of Nyberg-Rueppel and other DSA-like signature schemes with partially known nonces
Edwin El Mahassni, Phong Nguyen and Igor Shparlinski (Macquarie University, ENS, Macquarie University)

12:00-2:00 PM
Lunch Break

2:00-3:00 PM
Factoring Polynomials by Computing 0-1-Vectors with Lattice Reduction.
Mark van Hoeij (Florida State University)

3:15-3:45 PM
Improving lattice based cryptosystems using the Hermite Normal Form
Daniele Micciancio (UCSD)

3:45-4:15 PM
Lattice reduction using Magma: A demonstration
Allan Steel (University of Sydney)

4:15-4:30 PM
Concluding Remarks

Back to CaLC Home Page

Last Updated February 9, 2001.