21st Workshop on Elliptic Curve Cryptography

Nijmegen, The Netherlands, November 13–15, 2017

Program

Monday, November 13, 2017

8:00–8:45 Registration
8:45–9:00 Opening Remarks
9:00–10:00 TBA
Pınar Kılıçer
10:00–10:30 Coffee Break
10:30–11:30 Arithmetic concerning Poncelet's closure theorem
Jaap Top
11:30–12:30 Efficient arithmetic on binary elliptic curves
David Kohel
12:30–14:00 Lunch break
14:00–15:00 A kilobit hidden SNFS discrete logarithm computation
Emmanuel Thomé
15:00–15:30 Coffee Break
15:30–16:30 May the Fourth Be With You: A Microarchitectural Side Channel Attack on Several Real-World Applications of Curve25519
Daniel Genkin
16:30–17:30 Attacks on (EC)DSA with biased nonces
Mehdi Tibouchi
18:00–21:00 Reception and rump session

Tuesday, November 14, 2017

9:00–10:00 Isogeny graphs of ordinary abelian varieties
Benjamin Wesolowski
10:00–10:30 Coffee Break
10:30–11:30 20 years of isogeny based cryptography
Luca De Feo
11:30–12:30 Key encapsulation using supersingular isogenies
Craig Costello
12:30–14:00 Lunch break
14:00–15:00 TBA
Maria Dubovitskaya
15:00–15:30 Coffee Break
15:30–16:30 Innovations in permutation-based crypto
Joan Daemen
16:30–17:30 What's Up in Lattice Crypto?
Tancrède Lepoint
19:00–22:00 Banquet

Wednesday, November 15, 2017

9:00–10:00 Simulating DL computation in GF(pn) with the new variants of the Tower-NFS algorithm to deduce security level estimates
Aurore Guillevic
10:00–11:00 Pairings are not dead, just resting
Diego Aranha
11:00–11:30 Coffee Break
11:30–12:30 Fast endomorphisms in hardware
Kimmo Järvinen
12:30–13:30 qDSA: Small and Secure Digital Signatures with Curve-based Diffie-Hellman Key Pairs
Joost Renes