Talks

2019

Conference Talks

Seminars

Others

  • June 11 and 13, 2019, Inria Nancy. An introduction to NFS for discrete logarithm computation, with small examples in SageMath. Slides. SageMath code (.zip).
  • December 2, 2019, ECC 2019, Bochum, Germany. Rump session: 1001 ways to fail record computations. Slides.

2017

Invited talk

2016

Invited talk

Conference Talks

  • August 2016, SAC 2016 Selected Areas in Cryptography, St. John’s, Newfoundland, Memorial University, Canada, August 10-12, 2016, Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. Slides, Preprint.
  • June 2016, 2016 CMS Summer Meeting, Summer meeting of the Canadian Mathematical Society, Edmonton, University of Alberta, Canada, June 24-27, 2016, Faster Individual Discrete Logarithms in non-prime finite fields GF(pn) with the NFS and FFS algorithms. Slides, Preprint.
  • June 2016, CNTA XIV, 2016, 14th meeting of the Canadian Number Theory Asociation, Calgary, Alberta, Canada, June 20-24, 2016, Discrete Logarithm Record in a 508-bit finite field GF(p3) with the NFS algorithm. Slides, Preprint.

Seminars

  • April 2016, 21th, Radboud University, Nijmegen, Netherlands, Discrete logarithm computation record in a finite field GF(p3) of 508 bits with the Number Field Sieve algorithm.
  • April 2016, 13th, Université de Neuchâtel, Switzerland.
  • March 23rd, Number Nosh Seminar, University of Calgary, Point counting on genus two curves: Schoof-Elkies-Atkin variant (feed-back from a workshop at IPAM, UCLA).
  • February 10th, Number Nosh Seminar, University of Calgary, Computing discrete logarithms in finite fields with the Number Field Sieve algorithm.
  • January 27th, Number Nosh Seminar, University of Calgary, Computing discrete logarithms in finite fields with the Number Field Sieve algorithm.

2015

Invited talks

Conference Talks

  • November 2015, ASIACRYPT 2015, Auckland, New Zealand, November 29-December 3, Computing Individual Discrete Logarithms Faster in GF(pn) with the NFS-DL algorithm. Slides, Preprint.
  • October 2015, Journées Codage et Cryptographie (JC2), La Londe Les Maures, France, Calculs de logarithmes discrets dans GF(pk) à l’aide du crible de corps de nombres (NFS-DL), applications à k=2,3,4,6.
  • May 2015, AGCT 2015, CIRM, Luminy, France Improving NFS for the discrete logarithm problem in non-prime finite fields, polynomial selection and individual logarithm. Slides.
  • April 2015, EUROCRYPT 2015, Sofia, Bulgaria, Improving NFS for the discrete logarithm problem in non-prime finite fields. Slides, Preprint.

Seminars

2014

Seminar

2013

Invited talk

Conference Talk

  • June 2013, ACNS, Banff, Alberta, Canada, Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves. Preprint

2012

Conference Talks

  • October 2012, Journées Codage et Cryptographie, Dinard, France, Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves.
  • September 2012, YACC, Porquerolles, France, Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves.
  • May 2012, Pairing 2012, Cologne, Germany, Improved Broadcast Encryption Scheme with Constant-Size Ciphertext.Preprint
  • May 2012, Pairing 2012, Cologne, Germany, Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions.Preprint