Christophe Nègre

Publication Activity (10 Years)

Years Active: 2002-2021
Publications (10 Years): 12

Top Topics

Space Complexity

Addition Chains

Sparse Matrices

Homomorphic Encryption

Top Venues

IEEE Trans. Computers

J. Cryptogr. Eng.

Publications

Christophe Nègre
Side Channel Counter-measures based on Randomized AMNS Modular Multiplication. SECRYPT (2021)
Ilia Iliashenko, Christophe Nègre, Vincent Zucca
Integer Functions Suitable for Homomorphic Encryption over Finite Fields. WAHC@CCS (2021)
Ilia Iliashenko, Christophe Nègre, Vincent Zucca
Integer Functions Suitable for Homomorphic Encryption over Finite Fields. IACR Cryptol. ePrint Arch. 2021 (2021)
Christophe Nègre
Address-bit Differential Power Analysis on Boolean Split Exponent Counter-measure. ICETE (2) (2020)
Jean-Marc Robert, Christophe Nègre, Thomas Plantard
Efficient Fixed-base exponentiation and scalar multiplication based on a multiplicative splitting exponent recoding. J. Cryptogr. Eng. 9 (2) (2019)
Andrea Lesavourey, Christophe Nègre, Thomas Plantard
Efficient Leak Resistant Modular Exponentiation in RNS. ARITH (2017)
Christophe Nègre, Thomas Plantard
Efficient regular modular exponentiation using multiplicative half-size splitting. J. Cryptogr. Eng. 7 (3) (2017)
Andrea Lesavourey, Christophe Nègre, Thomas Plantard
Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications. SECRYPT (2016)
Christophe Nègre, Jean-Marc Robert
New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic. IEEE Trans. Computers 64 (10) (2015)
Christophe Nègre, Thomas Plantard, Jean-Marc Robert
Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand. ARITH (2015)
Christophe Nègre, Guilherme Perin
Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS. ACISP (2015)
Christophe Nègre, Jean-Marc Robert
Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve. SECRYPT (2015)
Michael François, David Defour, Christophe Nègre
A Fast Chaos-Based Pseudo-Random Bit Generator Using Binary64 Floating-Point Arithmetic. Informatica (Slovenia) 38 (2) (2014)
Christophe Nègre
Efficient binary polynomial multiplication based on optimized Karatsuba reconstruction. J. Cryptogr. Eng. 4 (2) (2014)
Murat Cenk, M. Anwar Hasan, Christophe Nègre
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. IEEE Trans. Computers 63 (9) (2014)
Kwang Ho Kim, Chol Ok Lee, Christophe Nègre
Binary Edwards Curves Revisited. INDOCRYPT (2014)
M. Anwar Hasan, Christophe Nègre
Multiway Splitting Method for Toeplitz Matrix Vector Product. IEEE Trans. Computers 62 (7) (2013)
Jithra Adikari, Ayad F. Barsoum, M. Anwar Hasan, Ashkan Hosseinzadeh Namin, Christophe Nègre
Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases. IEEE Trans. Computers 62 (1) (2013)
Murat Cenk, Christophe Nègre, M. Anwar Hasan
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products. IEEE Trans. Computers 62 (7) (2013)
Christophe Nègre, Jean-Marc Robert
in Scalar Multiplication over Binary Elliptic Curve. AFRICACRYPT (2013)
M. Anwar Hasan, Ashkan Hosseinzadeh Namin, Christophe Nègre
Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials. IEEE Trans. Very Large Scale Integr. Syst. 20 (3) (2012)
Jithra Adikari, M. Anwar Hasan, Christophe Nègre
Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$. Selected Areas in Cryptography (2012)
M. Anwar Hasan, Christophe Nègre
Sequential multiplier with sub-linear gate complexity. J. Cryptogr. Eng. 2 (2) (2012)
M. Anwar Hasan, Nicolas Méloni, Ashkan Hosseinzadeh Namin, Christophe Nègre
Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product. IEEE Trans. Computers 61 (2) (2012)
Murat Cenk, Christophe Nègre, M. Anwar Hasan
Improved Three-Way Split Formulas for Binary Polynomial Multiplication. Selected Areas in Cryptography (2011)
M. Anwar Hasan, Christophe Nègre
Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. IEEE Trans. Computers 60 (4) (2011)
Nicolas Méloni, Christophe Nègre, M. Anwar Hasan
High performance GHASH and impacts of a class of unconventional bases. J. Cryptogr. Eng. 1 (3) (2011)
Jean-Claude Bajard, Christophe Nègre, Thomas Plantard
Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. IEEE Trans. Computers 59 (12) (2010)
Nicolas Méloni, Christophe Nègre, M. Anwar Hasan
High Performance GHASH Function for Long Messages. ACNS (2010)
Nadia El Mrabet, Christophe Nègre
Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography. ACISP (2009)
M. Anwar Hasan, Christophe Nègre
Subquadratic Space Complexity Multiplier for a Class of Binary Fields Using Toeplitz Matrix Approach. IEEE Symposium on Computer Arithmetic (2009)
Christophe Nègre, Thomas Plantard
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation. ACISP (2008)
M. Anwar Hasan, Christophe Nègre
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. WAIFI (2008)
Yin Li, Christophe Nègre
An Efficient Multiplication Algorithm using Binomial Residue Representation. SECRYPT (2008)
Kwang Ho Kim, Christophe Nègre
Point Multiplication on Supersingular Elliptic Curves Defined over Fields of Characteristic 2 and 3. SECRYPT (2008)
Christophe Nègre
Efficient parallel multiplier in shifted polynomial basis. J. Syst. Archit. 53 (2-3) (2007)
Pascal Giorgi, Christophe Nègre, Thomas Plantard
Subquadratic Binary Field Multiplier in Double Polynomial System. SECRYPT (2007)
Christophe Nègre
Finite field arithmetic using quasi-normal bases. Finite Fields Their Appl. 13 (3) (2007)
Jean-Claude Bajard, Laurent Imbert, Christophe Nègre
Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation. IEEE Trans. Computers 55 (9) (2006)
Christophe Nègre
Finite Field Multiplication in Lagrange Representation Using Fast Fourrier Transform. SECRYPT (2006)
Christophe Nègre
Parallel Multiplication in F2n Using Condensed Matrix Representation. SECRYPT (2006)
Christophe Nègre
Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic. INDOCRYPT (2005)
Christophe Nègre
Quadrinomial Modular Arithmetic using Modified Polynomial Basis. ITCC (1) (2005)
Jean-Claude Bajard, Laurent Imbert, Christophe Nègre, Thomas Plantard
Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography. IEEE Symposium on Computer Arithmetic (2003)
Jean-Claude Bajard, Laurent Imbert, Christophe Nègre
) Using Lagrange Representation. INDOCRYPT (2002)