July 10, 2019. SIAM conference on applied
algebraic geometry, Bern, Switzerland, July 9-13, 2019,
MS134 part 4: coding theory and cryptography.
Pairing-Friendly Curves and Tower Number Field Sieve Algorithm.
Slides,
ePrint,
Magma and SageMath code GitLab.
June 21, 2019, Sorbonne Université, LIP6, Jussieu, Paris, France,
Séminaire C2
First step toward an implementation of the Tower Number Field Sieve: Murphy-alpha function for
polynomial selection.
Slides.
March 1st 2019, Université de Rennes I, France,
Séminaire
de cryptographie,
Discrete logarithm computation in finite fields GF(p^{k})
with NFS variants and consequences in pairing-based cryptography.
Slides.
February 28, 2019, Loria, France,
Séminaire
de sécurité du Loria,
Discrete logarithm computation in finite fields GF(p^{k})
with NFS variants and consequences in pairing-based cryptography.
Slides.
February, 12th 2019, Université de Franche-Comté, France, séminaire de théorie des nombres, Calculs de logarithmes discrets dans F_{pn} avec le crible de corps de nombres. Slides.
June 11 and 13, 2019, Inria Nancy. An introduction to NFS for discrete logarithm computation, with small examples in SageMath.
Slides,
SageMath code (.zip).
2017
Invited talk
November 2017,
21st Workshop on Elliptic
Curve Cryptography, Nijmegen, The Netherlands, November 13-15,
2017.
Simulating DL computation in GF(p^{n}) with the new variants of the Tower-NFS algorithm to deduce security level estimates.
Slides.
2016
Invited talk
August 2016,
Mathematical structures for cryptography workshop,
Lorentz Center, Leiden, Netherlands.
Consequences for pairing-based cryptography of the recent improvements on discrete logarithm computation in GF(p^{n}).
Slides.
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(p^{n}) 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(p^{3}) with the NFS algorithm.
Slides,
Preprint.
Seminars
April 21th, 2016, Radboud University, Nijmegen, Netherlands,
Discrete logarithm computation record in a finite field GF(p^{3}) of 508 bits with the Number Field Sieve algorithm.
April 13th, 2016, Université de Neuchâtel, Switzerland.
March 23rd, 2016, 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, 2016, Number Nosh Seminar, University of Calgary,
Computing discrete logarithms in finite fields with the Number Field Sieve algorithm.
January 27th, 2016, Number Nosh Seminar, University of Calgary,
Computing discrete logarithms in finite fields with the Number Field Sieve algorithm.
Rump Session
ANTS-XII,
University of Kaiserslautern, Germany, August 29 - September 2, 2016.
1001 ways to fail record computations.
Slides
2015
Invited talks
October 2015,
CATREL Workshop, Palaiseau, France,
Computing individual discrete logarithms faster in GF(p^{n}) with the Number Field Sieve algorithm.
Slides.
September 2015,
ECC Workshop, Bordeaux, France,
Computing individual discrete logarithms faster in GF(p^{n}) with the Number Field Sieve algorithm.
Slides.
Conference Talks
November 2015,
ASIACRYPT 2015,
Auckland, New Zealand, November 29-December 3,
Computing Individual Discrete Logarithms Faster in GF(p^{n}) with the NFS-DL algorithm.
Slides,
Paper.
October 2015, Journées Codage et Cryptographie
(JC2),
La Londe Les Maures, France,
Calculs de logarithmes discrets dans GF(p^{k}) à 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.
2015
Seminars
December 2015, 15th, GRACE Team
GT, Christmas Special, Fin de post-doc
March 2015, Université d'Aix Marseille,
Séminaire Arithmétique et Théorie de
l'Information,
Polynomial selection for NFS-DL in non-prime finite fields.
September 2013,
ECC Workshop, Leuven, Belgium,
Four dimensional GLV via the Weil restriction.
Conference Talk
June 2013,
ACNS, Banff, Alberta, Canada,
Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves.
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.
May 2012, Pairing 2012, Cologne, Germany,
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation
and Pairing-Friendly Constructions.