|
2006 Conferences
Timetable for ECC 2006
8:00- 8:50 Registration/Coffee
8:50- 9:00 Opening (Barbara Keyfitz & Jason Wu)
9:00- 9:50 Kristin Lauter
Cryptographic hash functions from expander graphs
9:50-10:20 Coffee break
10:20-11:10 Reinier Broker
Constructing elliptic curves for cryptography
11:10-12:00 Isabelle Dechene
Generalized Jacobians: Natural candidates for DL-based
cryptography
12:00- 2:00 Lunch
2:00- 2:50 Xavier Boyen
Practical aspects of identity-based encryption
2:50- 3:40 Michael Scott
Implementing cryptographic pairings
3:40- 4:10 Coffee break
4:10- 5:00 Laurie Law
Finding invalid signatures in pairing-based batches
5:00- 5:50 Nigel Smart
ID-based key agreement
6:00- ?? Cocktail Reception
6:30- ?? Rump Session
Tuesday (Sep 19)
8:30- 9:00 Coffee
9:00- 9:50 David Freeman
Methods for constructing pairing-friendly elliptic curves
9:50-10:20 Coffee break
10:20-11:10 Igor Shparlinski
Distribution of elliptic curves for pairing-based cryptography
11:10-12:00 Alice Silverberg
Using primitive subgroups in cryptography
12:00- 2:00 Lunch
2:00- 2:50 Dan Page
Compilers in (elliptic curve) cryptography
2:50- 3:40 Jan Pelzl
Cost estimates for ECC attacks with special-purpose hardware
3:40- 4:10 Coffee break
4:10- 5:00 Andreas Enge
An $L(1/3+\epsilon)$ algorithm for the discrete logarithm
problem in low degree curves
5:00- 5:50 Claus Diem
An index calculus algorithm for non-singular plane curves
of high genus
6:30- ?? Banquet [Chinese restaurant]
Wednesday (Sep 20)
Wednesday (September 20)
8:30- 9:00 Coffee
9:00- 9:50 Oliver Schirokauer
Extending the special number field sieve
9:50-10:40 Nicolas Theriault
Towards an exact cost analysis of index-calculus algorithms
10:40-11:10 Coffee break
11:10-12:00 Daniel J. Bernstein
Elliptic vs. hyperelliptic, part 1
12:00-12:50 Tanja Lange
Elliptic vs. hyperelliptic, part 2
12:50- 1:00 Closing
1:00- 3:00 Light lunch provided
|