| * | 2009 |
| 13 | EE | Nadia El Mrabet,
Christophe Nègre:
Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography.
ACISP 2009: 422-436 |
| 2008 |
| 12 | EE | Christophe Nègre,
Thomas Plantard:
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation.
ACISP 2008: 463-477 |
| 11 | | Kwang Ho Kim,
Christophe Nègre:
Point Multiplication on Supersingular Elliptic Curves Defined over Fields of Characteristic 2 and 3.
SECRYPT 2008: 373-376 |
| 10 | EE | M. Anwar Hasan,
Christophe Nègre:
Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation.
WAIFI 2008: 88-102 |
| 2007 |
| 9 | | Pascal Giorgi,
Christophe Nègre,
Thomas Plantard:
Subquadratic Binary Field Multiplier in Double Polynomial System.
SECRYPT 2007: 229-236 |
| 8 | EE | Christophe Nègre:
Efficient parallel multiplier in shifted polynomial basis.
Journal of Systems Architecture 53(2-3): 109-116 (2007) |
| 2006 |
| 7 | | Christophe Nègre:
Parallel Multiplication in F2n Using Condensed Matrix Representation.
SECRYPT 2006: 254-259 |
| 6 | | Christophe Nègre:
Finite Field Multiplication in Lagrange Representation Using Fast Fourrier Transform.
SECRYPT 2006: 320-323 |
| 5 | EE | 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): 1167-1177 (2006) |
| 2005 |
| 4 | EE | Christophe Nègre:
Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic.
INDOCRYPT 2005: 389-402 |
| 3 | EE | Christophe Nègre:
Quadrinomial Modular Arithmetic using Modified Polynomial Basis.
ITCC (1) 2005: 550-555 |
| 2003 |
| 2 | EE | 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: 181-187 |
| 2002 |
| 1 | EE | Jean-Claude Bajard,
Laurent Imbert,
Christophe Nègre:
Modular Multiplication in GF(pk) Using Lagrange Representation.
INDOCRYPT 2002: 275-284 |