|
|
Cryptography
|
|
and Lattices
|
|
Conference 2001
|
The focus of CaLC is on all aspects of lattices as used in
cryptography and complexity theory. We hope that the conference will
showcase the current state of lattice theory and will
encourage new research in both the theoretical and the practical uses
of lattices and lattice reduction in the cryptographic arena. We
encourage submission of papers from academia, industry, and other
organizations. All submitted papers will be reviewed.
Topics of interest include the following, but any paper broadly
connected with the use of lattices in cryptography or complexity theory
will be given serious consideration:
- Lattice reduction methods, including theory and practical implementation.
- Applications of lattice reduction methods in cryptography, cryptanalysis,
and related areas of algebra and number theory.
- Cryptographic constructions such as public key cryptosystems and
digital signatures based on lattice problems.
- Complexity theory of hard lattice problems such as SVP and CVP.
- Other lattice related cryptographic constructions,
for example based on cyclotomic fields, finite group rings,
or group representations.
Invited Speakers
- Don Coppersmith (IBM)
Finding Small Solutions to Small Degree Polynomials
- Ravi Kumar (IBM)
A Sieve Algorithm for the Shortest Lattice Vector Problem
- Phong Nguyen (ENS, CNRS)
The Two Faces of Lattices in Cryptography
- Mark van Hoeij (FSU)
Factoring Polynomials by Computing 0-1-Vectors with
Lattice Reduction.
Click here for the
complete list of speakers and program schedule.
Program Committee
- Don Coppersmith (IBM)
- Jeffrey Hoffstein (Brown, NTRU)
- Andrew Odlyzko (AT&T Labs)
- Arjen Lenstra (Citibank)
- Phong Nguyen (ENS, CNRS)
- Joe Silverman (Brown, NTRU)
All correspondence and/or questions should be directed to the
Program Chairs:
|
Joseph Silverman |
|
Jeffrey Hoffstein |
|
Mathematics Department |
|
Mathematics Department |
|
Brown University |
|
Brown University |
|
Providence, RI 02912 USA |
|
Providence, RI 02912 USA |
|
+1 401 863 1132 |
|
+1 401 863 1127 |
|
jhs@math.brown.edu |
|
jhoff@math.brown.edu |
-
Instructions for Authors
- Authors are invited to submit original papers.
(The deadline for submissions has passed.)
Authors of accepted papers will be sent detailed instructions
for submitting their papers for the proceedings. Questions
should be directed to
Joe Silverman.
Submissions must not substantially duplicate work that any
of the authors have published elsewhere or have submitted
in parallel to any other conferences or workshops that
have proceedings.
-
Workshop Proceedings
- It is planned to publish the proceedings in
Springer Lecture Notes in Computer Science.
Note that in order to be included in the proceedings, the authors of an
accepted paper must guarantee to present their contribution at the workshop
and must submit their final paper in an acceptable format.
-
Important Dates for Authors
|
Submission Deadline |
|
The deadline for submission of papers has passed.. |
|
Acceptance Notification |
|
January 15th, 2001. |
|
Final Version Due |
|
March 1, 2001. |
|
Conference |
|
March 29 and 30, 2001. |
-
Mailing List
- If you would like to receive calls for papers, program announcements,
and registration information, please send an email to
jhs@math.brown.edu
- Registration Information
- The deadline for early registration (reduced fee) has
been extended to February 16.
Click here
for registration information and a printable registration form.
Location
Brown University, founded in 1764, is located in
Providence, Rhode Island. The city is easily accessible by air, train
and car. T.F. Green International Airport in Rhode Island is the most
convenient airport, about 10 miles from campus with a variety of ground
transport available from the airport to Providence. It is also
possible to fly into Logan Airport in Boston and take ground transport
to Providence, about 40 miles.
Providence is 70 kilometers (42 miles) south of Boston and
250 kilometers (150 miles) northeast of New York City.
Click here for:
CaLC has received generous support from
The organizers express their sincere thanks.
Back to Top of Page
Last Updated February 9, 2001.
