ECC 2013
16 - 18 Sept 2013
Leuven - Belgium
17th Workshop on Elliptic Curve Cryptography

Program
Preliminary version of the program. Titles are subject to change.

Monday 16 September 2013

    8:30-9:20-- Registration, welcome coffee
    9:20-9:30Welcome
    9:30-10:30Ben Smith: Constructing fast, twist-secure elliptic curves using Q-curves (slides)
    10:30-11:00-- Coffee Break
    11:00-12:00Antoine Joux: A new index calculus algorithm with complexity $L(1/4+o(1))$ in very small characteristic (slides)
    12:00-13:00Robert Granger: On the Function Field Sieve and the Impact of Higher Splitting Probabilities (slides)
    13:00-14:30-- Lunch
    14:30-15:30Pierrick Gaudry: Discrete logarithms in GF(2^809) (slides)
    15:30-16:00-- Coffee Break
    16:00-17:00Kristin Lauter: An arithmetic intersection formula for denominators of Igusa class polynomials (slides)
    17:00-18:00Marco Streng: Applications of class groups of CM-fields (slides)
    18:15-22:00-- Reception sponsored by Microsoft Research + Rump session

Tuesday 17 September 2013

    9:30-10:30Aurore Guillevic: Four dimensional GLV via the Weil restriction (slides)
    10:30-11:00-- Coffee Break
    11:00-12:00Gilles Van Assche: Keccak (slides)
    12:00-13:00Emilia Käsper: ECC deployment on internet
    13:00-14:30-- Lunch
    14:30-15:30Joppe Bos: Fast Cryptography in Genus 2 (slides)
    15:30-16:00-- Coffee Break
    16:00-17:00Mehdi Tibouchi: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves (slides)
    17:00-18:00Thomaz Oliveira: Two is the fastest prime (slides)
    19:30-... -- Workshop Banquet

Wednesday 18 September 2013

    9:30-10:30 Maarten Derickx: Computing modular units and gonalities of modular curves (slides)
    10:30-11:00 -- Coffee Break
    11:00-12:00Kenny Paterson: TLS Security (slides)
    12:00-13:00Sujoy Sinha Roy: Tiny Programmable ECC Processor (slides)
    13:00-... -- Lunch

© 2014 K.U.Leuven ESAT/SCD - COSIC
Design: COSIC Webteam | Disclaimer
Last modified on 2013/10/09 16:49