Integral Points on Elliptic Curves Defined by Simplest Cubic Fields. - Sylvain Duquesne (Exp. Math., 2001)

Numerical Investigations Related to the Derivatives of the L-Series of Certain Elliptic Curves. - Christophe Delaunay; Sylvain Duquesne (Exp. Math., 2003)

Montgomery Scalar Multiplication for Genus 2 Curves. - Sylvain Duquesne (ANTS, 2004)

Classification of genus 2 curves over F2n and optimization of their arithmetic. - Bertrand Byramjee; Sylvain Duquesne (IACR Cryptol. ePrint Arch., 2004)

Background on Pairings. - Sylvain Duquesne; Gerhard Frey (Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2005)

Implementation of Pairings. - Sylvain Duquesne; Gerhard Frey (Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2005)

Arithmetic of Hyperelliptic Curves. - Sylvain Duquesne; Tanja Lange 001 (Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2005)

Pairing-Based Cryptography. - Sylvain Duquesne; Tanja Lange 001 (Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2005)

Improving the arithmetic of elliptic curves in the Jacobi model. - Sylvain Duquesne (Inf. Process. Lett., 2007)

Montgomery Ladder for All Genus 2 Curves in Characteristic 2. - Sylvain Duquesne (WAIFI, 2008)

Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation. - Jean-Claude Bajard; Sylvain Duquesne; Milos D. Ercegovac (IACR Cryptol. ePrint Arch., 2010)

RNS arithmetic in Fpk and application to fast pairing computation. - Sylvain Duquesne (IACR Cryptol. ePrint Arch., 2010)

Traces of the Group Law on the Kummer Surface of a Curve of Genus 2 in Characteristic 2. - Sylvain Duquesne (Math. Comput. Sci., 2010)

FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction. - Ray C. C. Cheung; Sylvain Duquesne; Junfeng Fan; Nicolas Guillermin; Ingrid Verbauwhede; Gavin Xiaoxu Yao (CHES, 2011)

A FPGA pairing implementation using the Residue Number System. - Sylvain Duquesne; Nicolas Guillermin (IACR Cryptol. ePrint Arch., 2011)

RNS arithmetic in pk and application to fast pairing computation. - Sylvain Duquesne (J. Math. Cryptol., 2011)

Tate Pairing Computation on Jacobi's Elliptic Curves. - Sylvain Duquesne; Emmanuel Fouotsa (Pairing, 2012)

Efficient Pairings Computation on Jacobi Quartic Elliptic Curves. - Sylvain Duquesne; Nadia El Mrabet; Emmanuel Fouotsa (IACR Cryptol. ePrint Arch., 2013)

Efficient computation of pairings on Jacobi quartic elliptic curves. - Sylvain Duquesne; Nadia El Mrabet; Emmanuel Fouotsa (J. Math. Cryptol., 2014)

Memory-saving computation of the pairing fi nal exponentiation on BN curves. - Sylvain Duquesne; Loubna Ghammam (IACR Cryptol. ePrint Arch., 2015)

Choosing and generating parameters for low level pairing implementation on BN curves. - Sylvain Duquesne; Nadia El Mrabet; Safia Haloui; Franck Rondepierre (IACR Cryptol. ePrint Arch., 2015)

Area-Efficient Hardware Implementation of the Optimal Ate Pairing over BN curves. - Anissa Sghaier; Loubna Ghammam; Zeghid Medien; Sylvain Duquesne; Mohsen Machhout (IACR Cryptol. ePrint Arch., 2015)

An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication. - Md. Al-Amin Khandaker; Hirotaka Ono 003; Yasuyuki Nogami; Masaaki Shirase; Sylvain Duquesne (ICISC, 2016)

Efficient Scalar Multiplication for Ate Based Pairing over KSS Curve of Embedding Degree 18. - Md. Al-Amin Khandaker; Yasuyuki Nogami; Hwajeong Seo; Sylvain Duquesne (WISA, 2016)

Memory-saving computation of the pairing final exponentiation on BN curves. - Sylvain Duquesne; Loubna Ghammam (Groups Complex. Cryptol., 2016)

Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem. - Shoma Kajitani; Yasuyuki Nogami; Shunsuke Miyoshi; Thomas H. Austin; Md. Al-Amin Khandaker; Nasima Begum; Sylvain Duquesne (Int. J. Netw. Comput., 2016)

Solving 114-Bit ECDLP for a Barreto-Naehrig Curve. - Takuya Kusaka; Sho Joichi; Ken Ikuta; Md. Al-Amin Khandaker; Yasuyuki Nogami; Satoshi Uehara; Nariyoshi Yamai; Sylvain Duquesne (ICISC, 2017)

Efficient Optimal Ate Pairing at 128-bit Security Level. - Md. Al-Amin Khandaker; Yuki Nanjo; Loubna Ghammam; Sylvain Duquesne; Yasuyuki Nogami; Yuta Kodera (IACR Cryptol. ePrint Arch., 2017)

Side-Channel Attack using Order 4 Element against Curve25519 on ATmega328P. - Yoshinori Uetake; Akihiro Sanada; Takuya Kusaka; Yasuyuki Nogami; Leo Weissbart; Sylvain Duquesne (ISITA, 2018)

Choosing and generating parameters for pairing implementation on BN curves. - Sylvain Duquesne; Nadia El Mrabet; Safia Haloui; Franck Rondepierre (Appl. Algebra Eng. Commun. Comput., 2018)

High speed and efficient area optimal ate pairing processor implementation over BN and BLS12 curves on FPGA. - Anissa Sghaier; Zeghid Medien; Loubna Ghammam; Sylvain Duquesne; Mohsen Machhout; Hassan Yousif Ahmed (Microprocess. Microsystems, 2018)

Updating Key Size Estimations for Pairings. - Razvan Barbulescu; Sylvain Duquesne (J. Cryptol., 2019)

Curves with fast computations in the first pairing group. - Remi Clarisse; Sylvain Duquesne; Olivier Sanders (IACR Cryptol. ePrint Arch., 2020)

Montgomery-friendly primes and applications to cryptography. - Jean-Claude Bajard; Sylvain Duquesne (J. Cryptogr. Eng., 2021)

Finite Field Arithmetic in Large Characteristic for Classical and Post-quantum Cryptography. - Sylvain Duquesne (WAIFI, 2022)

PMNS arithmetic for elliptic curve cryptography. - Fangan-Yssouf Dosso; Sylvain Duquesne; Nadia El Mrabet; Emma Gautier (IACR Cryptol. ePrint Arch., 2025)