Workshop on the Elliptic Curve Discrete Logarithm Problem
All lectures will take place in the Davis Centre, Room 1302, at the University of Waterloo.
Monday, November 3
8:00 - 9:00 am: coffee and registration 9:00 - 10:00 am: Andrew Odlyzko, Why discrete logs? 10:00 - 10:30 am: coffee break 10:30 - 11:30 am: Victor Shoup, Lower bounds for discrete logarithms and related problems 11:30 - 12:45 pm: lunch 12:45 - 1:45 pm: Dan Boneh, Black box fields: an alternate approach to computing discrete logs? 2:00 - 3:00 pm: Neal Koblitz, The field extension degree in the Menezes-Okamoto-Vanstone algorithm for discrete logs on elliptic curves 3:15 - 3:45 pm: Scott Vanstone: The Certicom ECC Challenge 6:00 pm: Conference banquet at the Waterloo Inn Sponsored by MasterCard International: Guest Speakers: Dimitrios Markakis, Mondex International Limited Steve Mott, Senior Vice-President, Mastercard International
Tuesday, November 4
8:00 - 9:00 am: coffee 9:00 - 10:00 am: Takakazu Satoh, Fermat quotients and the polynomial time algorithm for anomalous elliptic curves 10:00 - 10:30 am: coffee break 10:30 - 11:30 am: Keynote Lecture: Gerhard Frey, Aspects of DL-systems based on hyperelliptic curves 11:30 - 12:45 pm: lunch 12:45 - 1:45 pm: Ming-Deh Huang, Function field sieve method for discrete logarithsm over finite fields 2:00 - 3:00 pm: Sachar Paulus, Can we use sieving for computing DLs on elliptic curves? 3:00 - 3:30 pm: coffee break 3:30 - 4:30 pm: Andreas Stein, Efficient algorithms for computing in certain function fields