[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Fw: The Mathematics of Public-Key Cryptography, June 12 - June 17, 1999
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Hey all...
For any of you who are in and around Toronto, Ontario... Perhaps
I'll see you there...
Mike
- -----Original Message-----
From: Maria Foudolova <mfoudolo@fields.utoronto.ca>
To: <unlisted-recipients:; (no To-header on input)>
Date: Thursday, June 10, 1999 1:12 PM
Subject: The Mathematics of Public-Key Cryptography, June 12 - June
17, 1999
Below please find the final Schedule for the above-noted workshop.
Conference on
The Mathematics of Public Key Cryptography
The Fields Institute for
Research in the Mathematical Sciences
Toronto, Ontario
June 12 - 17, 1999
PROGRAM SCHEDULE
SATURDAY, JUNE 12 - 7:00 - 10:00 p.m.
Reception
SUNDAY, JUNE 13
8:45 Opening Remarks
Morning Session Chair: Jeff Hoffstein, Brown University
9:00 The Industry of Public-Key Cryptography
Paul Van Oorschot, Entrust Technologies
10:00 Break
10:30 Elliptic curve cryptography in the real world
Alfred Menezes, University of Waterloo
11:30 Efficient implementation of elliptic curve cryptography
Scott Vanstone, University of Waterloo
12:30 Lunch
Afternoon Session Chair: Neal Koblitz, University of Washington
2:00 A sublinear-time parallel algorithm for integer modular
exponentiation
Jon Sorenson, Butler University
2:30 A lattice-based public-key cryptosystem
Tom Cusick, SUNY Buffalo
3:00 Computing discrete logarithms in quadratic orders
Mike Jacobson, University of Waterloo
3:30 Break
4:00 Guaranteed message authentication faster than MD5
Dan Bernstein, University of Illinois, Chicago
4:30 Inversion in optimal extension fields
Dan Bailey, Worcester Polytechnic Institute
5:00 Comparison of algorithms to calculate quadratic irregularity of
prime numbers
Joshua Holden, University of Massachusetts
MONDAY, JUNE 14
Morning Session Chair: Edlyn Teske, University of Waterloo
9:00 Analysis of the Xedni-Calculus attack
Neal Koblitz, University of Washington
10:00 Break
10:30 Cryptographic constructions based on Galois actions
Gerhard Frey, University of Essen
11:30 Hyperelliptic function fields and cryptography
Andreas Stein, University of Waterloo
12:30 Lunch
Afternoon Session Chair: Herman te Riele, CWI
2:00 Catching kangaroos in function fields
Edlyn Teske, University of Waterloo
2:30 Efficient undeniable signature schemes based on ideal arithmetic
in quadratic orders
Sachar Paulus, KOBIL Computer
3:00 Algorithms for computations in the jacobian group of C_{ab}
curves and their applications
Arita Seigo, C & C Media Research Laboratories
3:30 The discrete logarithm problem in the jacobian of hyperelliptic
curves
Mark Bauer, University of Illinois
4:00 Break
4:30 Lattices and Cryptography
Jeff Hoffstein, Brown University
6:30 Number Theory Foundation Party
TUESDAY, JUNE 15
Morning Session Chair: Andrew Odlyzko, AT&T Bell Laboratories
8:30 Low degree polynomials
Don Coppersmith, IBM
9:30 Two contradictory conjectures concerning Carmichael numbers
Carl Pomerance, University of Georgia
10:30 Break
11:00 Class groups in cryptography
Johannes Buchmann, Technical University of Darmstadt
12:00 Speeding up the discrete log computation on curves with
automorphisms
Francois Morain, Ecole Polytechnique LIX
WEDNESDAY, JUNE 16
Morning Session Chair: Andreas Stein, University of Waterloo
9:00 Factorization of RSA-140 using the number field sieve
Herman te Riele, CWI
10:00 Break
10:30 Improved polynomial selection for the number field sieve
Brian Murphy, Australian National University
11:30 Recent progress on the discrete logarithm problem in finite
fields
Oliver Schirokauer, Oberlin College
12:30 Lunch
Afternoon Session Chair: Oliver Schirokauer, Oberlin College
2:00 Strategies in filtering in the number field sieve
Stefania Cavallar, CWI
2:30 Implementing the number field sieve for F_{p^2}
Damian Weber, Institut für Techno and Wirtschaftsmathematik
3:00 The elliptic curve discrete logarithm problem
Julia Chen, Tamkang University
3:30 Break
4:00 A method of constructing elliptic curves with nonsmooth orders
Doug Kuhlman, University of Illinois
4:30 Elliptic divisibility sequences and the discrete logarithm
problem
Nelson Stephens, University of London
5:00 Computing discrete logarithms in high-genus hyperelliptic
jacobians in provably subexponential time
Andreas Enge, University of Augsburg
7:00 Banquet at Casaloma
THURSDAY, JUNE 17
Morning Session Chair: Brian Murphy, Australian National University
8:30 Error-correcting codes and cryptography
Harald Niederreiter, Austrian Academy of Sciences
9:30 Security: definitions, assumptions, and proofs
Victor Shoup, IBM Zurich
10:30 Break
11:00 P-adic Numerical Analysis
Eric Bach, University of Wisconsin
12:00 Security in the random oracle + generic model
Claus Schnorr, University of Frankfurt
12:30 End of Conference
-----BEGIN PGP SIGNATURE-----
Version: PGP 5.5.5
iQA/AwUBN2BJrf5WqcMdbVvFEQLAiQCfZKhBFORhvHRn3vRDUhLU2RV0k5AAoOn0
QaUmUmtSTGaa2BC72nnXckCz
=ug/E
-----END PGP SIGNATURE-----