Post-quantum key exchange for the Internet based on lattices
Seminar at MSR India, Bangalore, India – Dec 21, 2016.
(slides)

Practical post-quantum key exchange from supersingular isogenies
Invited talk at SPACE2016, University of Hyderabad, Hyderabad, India – Dec 18, 2016.
(slides)

A gentle introduction to isogeny-based cryptography
Tutorial talk at SPACE2016, University of Hyderabad, Hyderabad, India – Dec 15, 2016.
(slides)

A gentle introduction to elliptic curve cryptography
Tutorial talk at SPACE2016, University of Hyderabad, Hyderabad, India – Dec 15, 2016.
(slides)

Post-quantum key exchange for the Internet based on lattices
Algebra seminar at University of Auckland, Auckland, New Zealand – Nov 16, 2016.
(slides) (recording)

Efficient algorithms for supersingular isogeny Diffie-Hellman
Talk at CRYPTO2016, Santa Barbara, USA – Aug 17, 2016.
(slides) (video)

Efficient algorithms for supersingular isogeny Diffie-Hellman
Talk at Radboud University, Nijmegen, Netherlands – May 4, 2016.
(slides)

Post-quantum key exchange from ideal lattices
Talk at QUT Maths Seminars series, Brisbane, Australia – Apr 1, 2016.
(slides)

An introduction to elliptic curve cryptography
Talk at QUT Maths Seminars series, Brisbane, Australia – Mar 18, 2016.
(slides)

FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime
Talk at AsiaCrypt2015, Auckland, New Zealand- Nov 30, 2015.
(slides)

FourQ: four-dimensional decompositions on a Q-curve
Talk at NIST Workshop on Elliptic Curve Cryptography Standards, Gaithersburg, Maryland, USA – June 12, 2015.
(slides) (video)

A brief discussion on selecting new elliptic curves
Talk at NIST Workshop on Elliptic Curve Cryptography Standards, Gaithersburg, Maryland, USA – June 11, 2015.
(slides) (video)

Genus 2 curves in cryptography: successes and challenges
Talk at AMS Special Session on Arithmetic Geometry, University of Nevada, Las Vegas, USA – April 20, 2015.
(slides)

Post-quantum key exchange from the ring learning with errors problem
NIST Workshop on Cybersecurity in a Post-Quantum World, Gaithersburg, Maryland, USA – April 3, 2015.
(slides)

Post-quantum key exchange from the ring learning with errors problem
MSR Annual Privacy Workshop, Redmond, USA – October 29, 2014.
(slides)

Selecting Elliptic Curves for Cryptography: an Efficiency and Security Analysis
Invited talk at ECC2014, Ramanujan Auditorium, Chennai, India – October 9, 2014.
(slides)

A quick quiz on cricket and crypto
Rump session talk at ECC2014, Ramanujan Auditorium, Chennai, India – October 8, 2014.
(slides)

Deterministic Generation of Elliptic Curves (a.k.a. “NUMS” Curves)
Joint talk with Brian LaMacchia, ITEF-90, Toronto, Canada – July 23, 2014.
(slides)

Faster Compact Diffie-Hellman: Endomorphisms on the x-line
EuroCrypt2014, Scandic Hotel, Copenhagen, Denmark – May 12, 2014.
(slides)

Faster Compact Diffie-Hellman: Endomorphisms on the x-line
MSR Annual Privacy Workshop, Redmond, USA – October 25, 2013.
(slides) 

The State-of-the-Art in Hyperelliptic Curve Cryptography
Workshop on Curves and Applications, Calgary, Canada – August 19, 2013.
(slides)

Exponentiating in Pairing Groups
SAC2013, Simon Fraser University, Vancouver, Canada – August 16, 2013.
(slides)

Faster compact Diffie-Hellman
Lunchtime talk at Microsoft Research, Redmond, USA – June 19, 2013.
(slides) 

Fast Cryptography in Genus 2
EuroCrypt2013, Caravel Hotel, Athens, Greece, May 27, 2013.
(slides)

5 slides on hyperelliptic curve cryptography
Crypto/Security forum, Microsoft Research, Redmond, USA, March 8, 2013.
(slides)

Efficient arithmetic on Jacobians of genus 2 curves
Joint Mathematics Meetings (JMM), San Diego, USA, January 12, 2013.
(slides)

Efficient pairing computation at the 192-bit and 256-bit security levels
Invited talk, ECC2012, Queretaro, Mexico, October 30, 2012.
(slides)

A tribute to Pierrick – Parts 1 and 2… and a tribute to Culture Club
Rump session talk, ECC2012, Queretaro, Mexico, October 29, 2012.
(slides)

An introduction to elliptic curves and the computation of cryptographic pairings
Introductory course on elliptic curve cryptography, ECC2012 , Queretaro, Mexico, October 28, 2012.
(slides)

Fast implementations in genus 2
Ei/Psi seminar in Utrecht, the Netherlands – October 21, 2012.
(slides)

Fast crypto in genus 2
End of internship talk at Microsoft Research, Redmond, USA – August 14, 2012.
(slides)

Pairings for Cryptographers
Talk at Microsoft Research, Redmond, USA – Aug 15, 2012.
(slides) (abstract)

Finding optimal elliptic curves for high-security pairings
Talk at Microsoft Research, Redmond, USA – June 21, 2012.
(slides)

Fast formulas for computing cryptographic pairings
Phd final (defense) seminar, Queensland University of Technology, Australia, May 21, 2012.
(slides)

Attractive subfamilies of BLS curves for implementing high-security pairings
IndoCrypt2011Ramanujan Auditorium, Institute of Mathematical Sciences, Chennai, India, December 13, 2011.
(slides)

Geometric flavored arithmetic on Jacobians of hyperellitpic curves
Seminar at University of California, Irvine, April 18, 2011.
(slides)

Computing cryptographic pairings – the state of the art
Seminar at University of California, Irvine, November 2, 2010.
(slides)

Fixed argument pairings
LatinCrypt2010, Baroque Hall, Puebla, Mexico, August 9, 2010.
(slides)

An introduction to computing cryptographic pairings
Invited talk at Izmir Yasar University, Izmir, Turkey, July 1, 2010.
(slides)

Delaying mismatched field multiplications in pairing computations
WAIFI2010, Grand Hyatt Hotel, Istanbul, Turkey, June 28, 2010.
(slides)

Faster pairing computations on curves with high-degree twists
PKC2010, Ecole Normale Superieure, Paris, France, May 27, 2010.
(slides)

Avoiding full extension field arithmetic in pairing computations
Africacrypt2010, Stellenbosch Institute for Advanced Studies, Stellenbosch, South Africa, May 4, 2010.
(slides)

Faster pairings on special Weierstrass curves
Pairing2009, Stanford University, Palo Alto, USA, August 14, 2009.
(slides)