Program


Date

Time

Invited Talk/Event

Media

Sept 5

08:00 - 09:00

Registration

 

09:00 - 09:15

ECC2016 Opening Concert by Oğuz Öz and Burak Özkan

[WATCH ONLINE]

09:15 - 10:00

Razvan Barbulescu, "Extended Tower Number Field Sieve: A New Complexity for Medium Prime Case"

[SLIDES]
[WATCH ONLINE]

10:00 - 10:30

Coffee/Tea Break

 

10:30 - 11:15

Shashank Singh, "A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm"

[SLIDES]
[WATCH ONLINE]

11:30 - 12:15

Gora Adj, "Discrete logarithms in the cryptographically-interesting field GF(3^{6*509})"

[SLIDES]
[WATCH ONLINE]

12:15 - 13:30

Lunch

 

13:30 - 14:15

Sebastian Kochinke, "Computing discrete logarithms with special linear systems"

[SLIDES]
[WATCH ONLINE]

14:30 - 15:15

Maike Massierer, "Counting points on geometrically hyperelliptic curves of genus three"

[SLIDES]
[WATCH ONLINE]

15:15 - 15:45

Coffee/Tea Break

 

15:45 - 16:30

Anja Becker, "Solving shortest and closest vector problems: The decomposition approach"

 

16:45 - 17:30

Chitchanok Chuengsatiansup, "Fast arithmetic on Hessian curves"

[SLIDES]
[WATCH ONLINE]

17:30 - 18:30

Welcome Cocktail

 

18:30 - 19:30

Rump Session

 

Sept 6

09:00 - 09:45

Benjamin Smith, "Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes" and "μKummer: efficient hyperelliptic signatures and key exchange on microcontrollers"

[SLIDES]
[WATCH ONLINE]

10:00 - 10:45

Pascal Sasdrich, "Implementing Curve25519 for Side-Channel--Protected Elliptic Curve Cryptography"

[SLIDES]
[WATCH ONLINE]

10:45 - 11:15

Coffee/Tea Break

 

11:15 - 12:00

Ruben Niederhagen, "Faster discrete logarithms on FPGAs"

[SLIDES]
[WATCH ONLINE]

12:15 - 13:00

Shoukat Ali, "A new algorithm for residue multiplication modulo $2^{521}-1$"

[SLIDES]
[WATCH ONLINE]

13:00 - 14:00

Lunch

 

20:30 - 23:00

Gala Dinner

 

Sept 7

09:00 - 09:45

Mehmet Sabır Kiraz, "Pairings and Cloud Security"

[SLIDES]
[WATCH ONLINE]

10:00 - 10:45

Jens Groth, "On the Size of Pairing-based Non-interactive Arguments"

[SLIDES]
[WATCH ONLINE]

10:45 - 11:15

Coffee/Tea Break

 

11:15 - 12:00

Emmanuel Fouotsa, "Faster Ate pairing computation on Selmer's model of elliptic curves"

[SLIDES]
[WATCH ONLINE]

12:15 - 13:00

Tung Chou, "The Simplest Protocol for Oblivious Transfer" and "Sandy2x: new Curve25519 speed records"

[SLIDES]
[WATCH ONLINE]

13:00 - 14:00

Lunch