Version francaise

Sylvain Duquesne

Université Rennes I
Laboratory IRMAR, UMR CNRS 6625
Campus Beaulieu.
35042 Rennes cedex

Office 613 building 22-23.
Phone: (+33)
Fax: (+33)
Email: sylvain.duquesne @


I am professor at the university of Rennes since 2008. My field of research is Number Theory and more particularly arithmetic and algoritmic on algebraic curves, as also applications in cryptography.

Main Responsibilities

  • In charge of the Cryptography Master Degree in Rennes
  • Director of the IRMAR laboratory (2017-2021)
  • CIMPA Scientific Officer for Sub-Saharan Africa (2013-2017)
  • Publications

  • Montgomery-friendly primes and applications to cryptography with J-C. Bajard, Journal of Cryptographic Engineering, vol. 11 (2021), pp.399-415.
  • Curves with fast computations in the first pairing group with R. Clarisse and O. Sanders, CANS 202, Lecture Notes in Computer Science, vol. 12579 (2020), pp. 280-298.
  • Multiplication and Squaring in Cubic and Quartic Extensions for Pairing Based Cryptography with Y. Kodera and Y. Nogami, Proceedings of the International Conference on Finite Fields and Applications (2020).
  • Generators and integral points on elliptic curves associated with simplest quartic fields with T. Nara and A. S. Zargar, Mathematica Slovaca, vol. 70:2 (2020), pp. 273-288.
  • Side-Channel Attack using Order 4 Element against Curve25519 on ATmega328P with Y. Uetake, A. Sanada, L. Weissbart, T. Kusaka, Y. Nogami, ISITA2018, IEEE (2018), pp. 618-622.
  • High Speed and Efficient Area Optimal Ate Pairing Processor Implementation over BN and BLS12 Curves on FPGA with A. Sghaier, M. Zeghid, L. Ghammam, M. Machhout and H. Y. Ahmed, Microprocessors and Microsystems - Embedded Hardware Design, vol. 61 (2018), pp. 227-241.
  • Updating key size estimations for pairings with R. Barbulescu, Journal of Cryptology, vol. 32:4, pp. 1298-1336 (2019).
  • Solving 114-bit ECDLP for a Barreto-Naehrig Curve with T. Kusaka, S. Joichi, K. Ikuta, A. Khandaker, Y. Nogami, S. Uehara and N. Yamai, ICISC, Lecture Notes in Computer Science, vol. 10779 (2018), pp. 231-244.
  • Choosing and generating parameters for low level pairing implementation on BN curves with N. El Mrabet, S. Haloui and F. Rondepierre, Applicable Algebra in Engineering, Communication and Computing, vol. 29:2, pp. 113-147 (2018).
  • Efficient Optimal Ate Pairing at 128-bit Security Level with A. Khandaker, Y. Nanjo, L. Ghammam, Y.i Nogami and Y. Kodera, Indocrypt, Lecture Notes in Computer Science (2017)
  • Efficient Scalar Multiplication for Ate Based Pairing over KSS Curve of Embedding Degree 18 with A. Khandaker, Y. Nogami and H. Seo, WISA, Lecture Notes in Computer Science, vol. 10144 (2017) pp. 221-232.
  • Arithmetic of Finite Fields, 6th International Workshop, WAIFI 2016, Ghent, Belgium, July 13-15, 2016, Revised Selected Papers, éditeur with Svetla Petkova-Nikova, Lecture Notes in Computer Science, vol. 10064 (2017).
  • An Improvement of Optimal Ate Pairing on KSS curve with Pseudo 12-sparse Multiplication, with A. Khandaker, H. Ono, Y. Nogami and M. Shirase, ICISC, Lecture Notes in Computer Science, vol. 10157 (2017) pp. 1-12.
  • Chapters 5 and 10 of "Guide to Pairing-Based Cryptography" with J.L. Beuchat, N. ElMrabet, L. Fuentes-Castañeda, S. Haloui, F. Rodríguez-Henríquez and F. Rondepierre.
  • Web-based Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem with S. Kajitani, Y. Nogami, S. Miyoshi, T. Austin, K. Al-Amin and N. Begum, International Journal of Networking and Computing, vol. 6:2 (2016) pp 181-194.
  • Memory-saving computation of the pairing final exponentiation on BN curves, with L. Ghammam, Groups, Complexity, Cryptology, vol. 8:1 (2016) pp. 75-90.
  • Efficient Pairing Computation on Jacobi Quartic Elliptic Curves, with N. El Mrabet and E. Fouotsa, Journal of Mathematical Cryptology, vol. 8:4 (2014) pp. 331-362.
  • Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation, with J. C. Bajard and M. Ercegovac, Publications Mathématiques de Besancon, vol. 1 (2013), pp. 67-87.
  • Tate Pairing Computation on Jacobi's Elliptic Curves, with E. Fouotsa, Pairing, Lecture Notes in Computer Science, vol. 7708 (2012), pp. 254-269
  • FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction, with R. Cheung, J. Fan, N. Guillermin, I. Verbauwhede and G. Yao, CHES, Lecture Notes in Computer Science, vol. 6917 (2011), pp. 421-441.
  • RNS arithmetic in $\F_{p^k}$ and application to fast pairing computation, Journal of Mathematical Cryptology, vol. 5:1 (2011), pp. 51-88.
  • Traces of the group law on the Kummer surface of a curve of genus 2 in characteristic 2, Mathematics in Computer Science vol. 3:2 (2010), pp. 173-183.
  • Montgomery Ladder for all Genus 2 Curves in Characteristic 2, Lecture Notes in Computer Sciences, vol. 5130 (2008), pp. 174-188.
  • Courbes algébriques : de l'inutile à l'indispensable, Habilitation à Diriger des Recherches, Université Montpellier 2 (2007).
    Download it.
  • Traces of the group law on the Kummer surface of a curve of genus 2 in characteristic 2, submitted.
  • Improving the Arithmetic of Elliptic Curves in the Jacobi Model, Information Processing Letters (2007).
  • Rational Points on Higher Genus Curves, Chapter 13 of ''Number Theory, Volume II: Analytic and Modern Tools'', H. Cohen, Graduate Texts in Mathematics 240 (2007).
  • Elliptic curves associated with simplest quartic fields, Journ. Théor. Nombres Bordeaux, Vol. 19 (2007), no. 1, pp. 81-100 .
  • Residue systems efficiency for modular products summation: application to elliptic curves cryptography, with J. C. Bajard, M. Ercegovac, N. Meloni, Proc. SPIE Vol. 6313, 631304 (Aug. 25, 2006).
  • Chapter 6,14,16 and 24 of "Handbook of elliptic and hyperelliptic curves in cryptography", with T. Lange and G. Frey (2005).
  • Montgomery scalar multiplication for genus 2 curves, ANTS VI, LNCS 3076 (2004), pp. 153-168.
  • Classification of genus 2 curves over $F_2^n$ and optimization of their arithmetic, with B. Byramjee, Cryptology ePrint Archive no. 107 (2004) and international patent with Oberthur Card Systems.
  • Hyperelliptic Curves Cryptosystems: a new solution to replace RSA, with B. Byramjee, e-smart 2003.
  • Numerical investigations related to the derivatives of the L-series of certain elliptic curves, with C. Delaunay, Experimental Mathematics Vol 12 (2003) no. 3, pp. 311--317.
  • Points rationnels and méthode de Chabauty elliptique (french), Journal de Théorie des Nombres de Bordeaux, Vol. 15 (2003), no. 1, pp.99-113.
  • Hauteurs and descente infinie sur les courbes hyperelliptiques (french), Publications mathématiques de l'université de Besancon, 2002.
  • Rational Points on Curves and an Explicit Weierstrass Preparation Theorem, Manuscripta Mathematica, Vol. 108 (2002), pp. 191-204.
  • Integral Points on Elliptic Curves Defined by Simplest Cubic Fields, Experimental Math., Vol. 10:1 (2001), pp. 91-102.
  • Calculs Effectifs des Points Entiers and Rationnels sur les Courbes (french), Thèse de Doctorat, Université Bordeaux I, 2001.
    Download it.