Journaux internationaux
-
Efficient Fixed-base exponentiation and scalar multiplication based on a multiplicative splitting exponent recoding.
C. Negre, T. Plantard, J.-M. Robert.
J. Cryptographic Engineering 9(2): 115-136 (2019) -
Efficient regular modular exponentiation using multiplicative half-size splitting.
C. Negre, T. Plantard
J. Cryptographic Engineering 7(3): 245-253 (2017) -
New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic.
C. Negre, J.-M. Robert.
IEEE Trans. Computers 64(10): 2875-2890 (2015) preprint -
Efficient binary polynomial multiplication based on optimized Karatsuba reconstruction.
C. Negre.
J. Cryptographic Engineering 4(2): 91-106 (2014) preprint -
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination.
M. Cenk, M.A. Hasan, C. Negre.
IEEE Trans. Computers 63(9): 2273-2287 (2014) preprint -
Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases.
J. Adikari, A.F. Barsoum, M.A. Hasan, A.H. Namin, C. Negre
IEEE Trans. Computers 62(1): 193-199 (2013) -
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products.
M. Cenk, C. Negre, M.A. Hasan
IEEE Trans. Computers 62(7): 1345-1361 (2013) preprint -
Multiway Splitting Method for Toeplitz Matrix Vector Product.
M.A. Hasan,C. Negre,
IEEE Trans. Computers 62(7): 1467-1471 (2013) -
Sequential multiplier with sub-linear gate complexity.
M.A. Hasan,C. Negre,
J. Cryptographic Engineering 2(2): 91-97 (2012) preprint -
Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product.
M.A. Hasan, N. Méloni, A.H. Namin, C. Negre,
IEEE Trans. Computers 61(2): 151-163 (2012) preprint -
Toeplitz Matrix Approach for Binary Field Multiplication Using Quadrinomials.
M.A. Hasan, A.H. Namin, C. Negre,
IEEE Trans. VLSI Syst. 20(3): 449-458 (2012) preprint -
High Performance GHASH and Impacts of a Class of Unconventional Bases.
A. Hasan, N. Meloni, C. Negre,
Journal of Crypographic Engineering, Volume 1, Issue 3 (2011), Page 201-218
-
Low Space Complexity Multiplication over
Binary Fields with Dickson Polynomial Representation ,
A. Hasan, C. Negre,
IEEE Trans. Computers 60(4): 602-607 (2011). preprint -
Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation ,
J.-C. Bajard, C. Negre and T. Plantard,
Journal IEEE Transactions on Computers, Vol. 59, N. 12, p. 1585-1597, December 2010. - Arithmetic Operations in Finite Fields of Medium Prime Characteristic using Lagrange Representation
J.-C.Bajard, L. Imbert and C. Negre,
IEEE trans. comp., vol. 55 (9), pp. 1167-1177 september, 2006. paper - Efficient parallel multiplier in shifted polynomial basis, special issue of Journal of Systems Architecture,
C. Negre,
Embedded Hardware Harchitecture, vol. 53, issues 2-3, pages 109-116, feb. 2007. paper . - Finite field arithmetic using quasi-normal basis,
C.Negre,
Finite Fields and Their Applications, vol13, pp. 635-647, Elsevier . paper
Congrès internationaux avec comité de sélection
- Efficient Leak Resistant Modular Exponentiation in RNS.
A. Lesavourey, C. Negre, T. Plantard
ARITH 2017: 156-163 - Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications.
A. Lesavourey, C. Negre, T. Plantard
SECRYPT 2016: 368-375. - Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS.
C. Negre, G. Perin
ACISP 2015: 107-124 preprint -
Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand.
C. Negre, T. Plantard, J.-M. Robert.
ARITH 2015: 144-151 preprint -
Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve.
C. Negre, J.-M. Robert.
SECRYPT 2015: 202-209 preprint -
Impact of Optimized Field Operations AB, AC and AB + CD in Scalar Multiplication over Binary Elliptic Curve.
C. Negre, J.-M. Robert.
AFRICACRYPT 2013: 279-296 preprint -
Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$.
J. Adikari, M.A. Hasan, C. Negre
Selected Areas in Cryptography 2012: 166-183 preprint - Improved Three-Way Split Formula for Binary Polynomial Multiplication,
M. Cenk, C. Negre and A. Hasan ,
In the proceedings of SAC 2011. - High Performance GHASH Function for Long Messages,
N. Meloni, C. Negre and A. Hasan ,
In the proceedings of ACNS 2010. - Finite field multiplication combining AMNS and DFT approach for pairing cryptography.
N. El Mrabet and C. Negre.
In Proceedings of Australasian Conference on Information Security and Privacy (ACISPP 09), 2009. -
Subquadratic Space Complexity Multiplier for a Class of Finite Fields Using Toeplitz Matrix Approach.
A. Hasan and C. Negre.
In ARITH 19, 19th IEEE Symposium on Computer Arithmetic, 2009. - Point Multiplication on Supersingular Elliptic Curves Defined over Fields of Characteristic 2 and 3,
K-H Kim and C. Negre,
in SECRYPT'08, Porto, Portugal, july 2008. paper - An efficient multiplication algorithm using binomial residue representation ,
Li and C. Negre,
in SECRYPT'08, Porto, Portugal, july 2008. paper , talk . -
Subquadratic pace complexity multiplication over binary fields with Dickson polynomial representation
A. Hasan and C. Negre,
WAIFI, july 2008, Siena, Italy. paper , talk . - Efficient modular arithmetic in Adapted Modular Number System using Lagrange representation,
C. Negre and T. Plantard, ACISP 2008. Wollongong, AUSTRALIA, July 7-9, 2008. paper . -
Subquadratic Binary Field Multiplier in Double Polynomial System ,
P.Giorgi, C. Negre, T. Plantard,
in SECRYPT'07, Barcelone,Espagne,July 2007. paper , talk . - Parallel Multiplication in GF(2^n) using Condensed Matrix Representation ,
C. Negre,
in SECRYPT'06, Setúbal,Portugal,August 2006. paper , talk . -
Finite Field Multiplication in Lagrange Representation Using Fast Fourrier Transform,
C. Negre,
in SECRYPT'06, Setúbal,Portugal, August 2006. paper -
Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic ,
C. Negre
Indocrypt 2005 , Bangalore Inde, decembre 2005, LNCS 3797, pp 389-402. paper , talk . - Exponentiation to the power p in GF(p^k) using Variants of Montgomery Modular Arithmetic ,
C. Negre,
Nordsec 2005, Tartu Estonie, octobre 2005. paper , talk -
Quadrinomial Modular Multiplication using Modified Polynomial Basis ,
C. Negre,
ITCC 2005, Las Vegas USA, avril 2005, LNCS,
aussi Chapitre invité dans New Trends in Cryptographic Systems, Chap 5, pp 53-63, Nova Science Publishers. paper , talk . -
Efficient Multiplication in GF(p^k) for Elliptic Curve Cryptography,
J.-C. Bajard, L. Imbert, C. Negre et T. Plantard,
ARITH 16, 16th IEEE Symposium on Computer Arithmetic June 15-18, 2003 Santiago de Compostela, SPAIN. paper -
Modular Multiplication in GF(p^k) using Lagrange Representation,
J.-C. Bajard, L. Imbert and C. Negre,
Third International Cryptology Conference in India, December 15-18, 2002 Hyderabad , Inde. paper .
Rapports de recherche
- Etat de l'art des corps finis ,
C. Negre,
RR2004 No 04048 LIRMM. paper - Double Polynomial System Representation For Binary Field Arithmetic,
J.C. Bajard, T. Plantard and C. Negre,
RR No RR2005-05 DALI. paper
Thèse de doctorat
Opérateurs Arithmétiques pour la Cryptographie Basée sur les Courbes Elliptiques .
Directeur de Thèse J.-C. Bajard , co-encadrant P. Elbaz Vincent.
Le manuscrit : ps ou pdf .
Les transparents de la soutenance de th&eagravese : slides.pdf.
Exposés
- Subquadratic Binary Field Multiplier using Double Polynomial System , seminar of CCAR, Waterloo Ontario Canada, January 2008.
- Multiplication modulaire dans les syst&eagravemes de représentation adaptés en utilisant la représentation de Lagrange , Journées Code et Cryptographie, Eymoutier, octobre 2006.
- Bases Quasi-Normales , seminaire Limoges, 7 dec 2004.
- Introduction à la Cryptographie , Doctiss, Montpellier, février 2004, .
- Bases Quasi-Normales ,Arinews - octobre 2002 .