- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j10 |      | 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): 193-199 (2013) |
| 2012 | ||
| j9 | | M. Anwar Hasan, Christophe Nègre: Sequential multiplier with sub-linear gate complexity. J. Cryptographic Engineering 2(2): 91-97 (2012) |
| j8 | | M. Anwar Hasan, Nicolas Meloni, 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): 151-163 (2012) |
| j7 | | M. Anwar Hasan, Ashkan Hosseinzadeh Namin, Christophe Nègre: Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials. IEEE Trans. VLSI Syst. 20(3): 449-458 (2012) |
| c16 | | 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: 166-183 |
| 2011 | ||
| j6 | | Nicolas Meloni, Christophe Nègre, M. Anwar Hasan: High performance GHASH and impacts of a class of unconventional bases. J. Cryptographic Engineering 1(3): 201-218 (2011) |
| j5 | | M. Anwar Hasan, Christophe Nègre: Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. IEEE Trans. Computers 60(4): 602-607 (2011) |
| c15 | | Murat Cenk, Christophe Nègre, M. Anwar Hasan: Improved Three-Way Split Formulas for Binary Polynomial Multiplication. Selected Areas in Cryptography 2011: 384-398 |
| 2010 | ||
| j4 | | Jean-Claude Bajard, Christophe Nègre, Thomas Plantard: Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. IEEE Trans. Computers 59(12): 1585-1597 (2010) |
| c14 | | Nicolas Meloni, Christophe Nègre, M. Anwar Hasan: High Performance GHASH Function for Long Messages. ACNS 2010: 154-167 |
| 2009 | ||
| c13 | | Nadia El Mrabet, Christophe Nègre: Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography. ACISP 2009: 422-436 |
| c12 | | 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: 67-75 |
| 2008 | ||
| c11 | | Christophe Nègre, Thomas Plantard: Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation. ACISP 2008: 463-477 |
| c10 |  | Yin Li, Christophe Nègre: An Efficient Multiplication Algorithm using Binomial Residue Representation. SECRYPT 2008: 319-324 |
| c9 | | Kwang Ho Kim, Christophe Nègre: Point Multiplication on Supersingular Elliptic Curves Defined over Fields of Characteristic 2 and 3. SECRYPT 2008: 373-376 |
| c8 | | M. Anwar Hasan, Christophe Nègre: Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. WAIFI 2008: 88-102 |
| 2007 | ||
| j3 | | Christophe Nègre: Finite field arithmetic using quasi-normal bases. Finite Fields and Their Applications 13(3): 635-647 (2007) |
| j2 | | Christophe Nègre: Efficient parallel multiplier in shifted polynomial basis. Journal of Systems Architecture 53(2-3): 109-116 (2007) |
| c7 | | Pascal Giorgi, Christophe Nègre, Thomas Plantard: Subquadratic Binary Field Multiplier in Double Polynomial System. SECRYPT 2007: 229-236 |
| 2006 | ||
| j1 | | 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) |
| c6 | | Christophe Nègre: Parallel Multiplication in F2n Using Condensed Matrix Representation. SECRYPT 2006: 254-259 |
| c5 | | Christophe Nègre: Finite Field Multiplication in Lagrange Representation Using Fast Fourrier Transform. SECRYPT 2006: 320-323 |
| 2005 | ||
| c4 | | Christophe Nègre: Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic. INDOCRYPT 2005: 389-402 |
| c3 | | Christophe Nègre: Quadrinomial Modular Arithmetic using Modified Polynomial Basis. ITCC (1) 2005: 550-555 |
| 2003 | ||
| c2 | | 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 | ||
| c1 | | Jean-Claude Bajard, Laurent Imbert, Christophe Nègre: Modular Multiplication in GF(pk) Using Lagrange Representation. INDOCRYPT 2002: 275-284 |
Data released under the ODC-BY 1.0 license — See also our legal information page