Modular Multiplication in GF(pk) Using Lagrange Representation. - Jean-Claude Bajard; Laurent Imbert; Christophe Nègre (INDOCRYPT, 2002)

Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography. - Jean-Claude Bajard; Laurent Imbert; Christophe Nègre; Thomas Plantard (IEEE Symposium on Computer Arithmetic, 2003)

Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic. - Christophe Nègre (INDOCRYPT, 2005)

Quadrinomial Modular Arithmetic using Modified Polynomial Basis. - Christophe Nègre (ITCC (1), 2005)

Parallel Multiplication in F2n Using Condensed Matrix Representation. - Christophe Nègre (SECRYPT, 2006)

Finite Field Multiplication in Lagrange Representation Using Fast Fourrier Transform. - Christophe Nègre (SECRYPT, 2006)

Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation. - Jean-Claude Bajard; Laurent Imbert; Christophe Nègre (IEEE Trans. Computers, 2006)

Subquadratic Binary Field Multiplier in Double Polynomial System. - Pascal Giorgi; Christophe Nègre; Thomas Plantard (SECRYPT, 2007)

Finite field arithmetic using quasi-normal bases. - Christophe Nègre (Finite Fields Their Appl., 2007)

Efficient parallel multiplier in shifted polynomial basis. - Christophe Nègre (J. Syst. Archit., 2007)

Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation. - Christophe Nègre; Thomas Plantard (ACISP, 2008)

Point Multiplication on Supersingular Elliptic Curves Defined over Fields of Characteristic 2 and 3. - Kwang Ho Kim; Christophe Nègre (SECRYPT, 2008)

An Efficient Multiplication Algorithm using Binomial Residue Representation. - Yin Li; Christophe Nègre (SECRYPT, 2008)

Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. - M. Anwar Hasan; Christophe Nègre (WAIFI, 2008)

Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography. - Nadia El Mrabet; Christophe Nègre (ACISP, 2009)

Subquadratic Space Complexity Multiplier for a Class of Binary Fields Using Toeplitz Matrix Approach. - M. Anwar Hasan; Christophe Nègre (IEEE Symposium on Computer Arithmetic, 2009)

High Performance GHASH Function for Long Messages. - Nicolas Méloni; Christophe Nègre; M. Anwar Hasan (ACNS, 2010)

Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. - Jean-Claude Bajard; Christophe Nègre; Thomas Plantard (IEEE Trans. Computers, 2010)

Improved Three-Way Split Formulas for Binary Polynomial Multiplication. - Murat Cenk; Christophe Nègre; M. Anwar Hasan (Selected Areas in Cryptography, 2011)

High performance GHASH and impacts of a class of unconventional bases. - Nicolas Méloni; Christophe Nègre; M. Anwar Hasan (J. Cryptogr. Eng., 2011)

Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. - M. Anwar Hasan; Christophe Nègre (IEEE Trans. Computers, 2011)

Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $ mathbb{F}_{2^{1223}}$. - Jithra Adikari; M. Anwar Hasan; Christophe Nègre (Selected Areas in Cryptography, 2012)

Sequential multiplier with sub-linear gate complexity. - M. Anwar Hasan; Christophe Nègre (J. Cryptogr. Eng., 2012)

Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product. - M. Anwar Hasan; Nicolas Méloni; Ashkan Hosseinzadeh Namin; Christophe Nègre (IEEE Trans. Computers, 2012)

Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials. - M. Anwar Hasan; Ashkan Hosseinzadeh Namin; Christophe Nègre (IEEE Trans. Very Large Scale Integr. Syst., 2012)

Impact of Optimized Field Operations AB, AC and AB + CD in Scalar Multiplication over Binary Elliptic Curve. - Christophe Nègre; Jean-Marc Robert 003 (AFRICACRYPT, 2013)

Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases. - Jithra Adikari; Ayad F. Barsoum; M. Anwar Hasan; Ashkan Hosseinzadeh Namin; Christophe Nègre (IEEE Trans. Computers, 2013)

Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products. - Murat Cenk; Christophe Nègre; M. Anwar Hasan (IEEE Trans. Computers, 2013)

Multiway Splitting Method for Toeplitz Matrix Vector Product. - M. Anwar Hasan; Christophe Nègre (IEEE Trans. Computers, 2013)

Binary Edwards Curves Revisited. - Kwang Ho Kim; Chol Ok Lee; Christophe Nègre (INDOCRYPT, 2014)

A Fast Chaos-Based Pseudo-Random Bit Generator Using Binary64 Floating-Point Arithmetic. - Michael François; David Defour; Christophe Nègre (Informatica (Slovenia), 2014)

Efficient binary polynomial multiplication based on optimized Karatsuba reconstruction. - Christophe Nègre (J. Cryptogr. Eng., 2014)

Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. - Murat Cenk; M. Anwar Hasan; Christophe Nègre (IEEE Trans. Computers, 2014)

Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS. - Christophe Nègre; Guilherme Perin (ACISP, 2015)

Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand. - Christophe Nègre; Thomas Plantard; Jean-Marc Robert 003 (ARITH, 2015)

Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve. - Christophe Nègre; Jean-Marc Robert 003 (SECRYPT, 2015)

New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic. - Christophe Nègre; Jean-Marc Robert 003 (IEEE Trans. Computers, 2015)

Multiplication in Finite Fields and Elliptic Curves. - Christophe Nègre (2016)

Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications. - Andrea Lesavourey; Christophe Nègre; Thomas Plantard (SECRYPT, 2016)

Efficient Leak Resistant Modular Exponentiation in RNS. - Andrea Lesavourey; Christophe Nègre; Thomas Plantard (ARITH, 2017)

Efficient regular modular exponentiation using multiplicative half-size splitting. - Christophe Nègre; Thomas Plantard (J. Cryptogr. Eng., 2017)

Efficient Fixed-base exponentiation and scalar multiplication based on a multiplicative splitting exponent recoding. - Jean-Marc Robert 003; Christophe Nègre; Thomas Plantard (J. Cryptogr. Eng., 2019)

Address-bit Differential Power Analysis on Boolean Split Exponent Counter-measure. - Christophe Nègre (ICETE (2), 2020)

Side Channel Counter-measures based on Randomized AMNS Modular Multiplication. - Christophe Nègre (SECRYPT, 2021)

Integer Functions Suitable for Homomorphic Encryption over Finite Fields. - Ilia Iliashenko; Christophe Nègre; Vincent Zucca (IACR Cryptol. ePrint Arch., 2021)

A Toolchain for Deterministic Parallelism on an Embedded Bare-metal Platform. - Kenelm Louetsi; Christophe Nègre; David Parello (MCSoC, 2024)

Virtually Free Randomisations of NTT in RLWE Cryptosystem to Counteract Side Channel Attack Based on Belief Propagation. - Christophe Nègre; Mbaye Ngom (SECRYPT, 2024)

Area Optimized Architectures for Galois Counter Mode. - Jithra Adikari; M. Anwar Hasan; Christophe Nègre; Pujan Patel (FICC (2), 2025)