Christophe Nègre

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