default search action
Christophe Nègre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Christophe Nègre, Mbaye Ngom:
Virtually Free Randomisations of NTT in RLWE Cryptosystem to Counteract Side Channel Attack Based on Belief Propagation. SECRYPT 2024: 866-875 - 2021
- [c26]Ilia Iliashenko, Christophe Nègre, Vincent Zucca:
Integer Functions Suitable for Homomorphic Encryption over Finite Fields. WAHC@CCS 2021: 1-10 - [c25]Christophe Nègre:
Side Channel Counter-measures based on Randomized AMNS Modular Multiplication. SECRYPT 2021: 611-619 - [i1]Ilia Iliashenko, Christophe Nègre, Vincent Zucca:
Integer Functions Suitable for Homomorphic Encryption over Finite Fields. IACR Cryptol. ePrint Arch. 2021: 1335 (2021) - 2020
- [c24]Christophe Nègre:
Address-bit Differential Power Analysis on Boolean Split Exponent Counter-measure. ICETE (2) 2020: 632-637
2010 – 2019
- 2019
- [j18]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): 115-136 (2019) - 2017
- [j17]Christophe Nègre
Efficient regular modular exponentiation using multiplicative half-size splitting. J. Cryptogr. Eng. 7(3): 245-253 (2017) - [c23]Andrea Lesavourey
Efficient Leak Resistant Modular Exponentiation in RNS. ARITH 2017: 156-163 - 2016
- [b1]Christophe Nègre:
Multiplication in Finite Fields and Elliptic Curves. University of Montpellier, France, 2016 - [c22]Andrea Lesavourey
Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications. SECRYPT 2016: 368-375 - 2015
- [j16]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): 2875-2890 (2015) - [c21]Christophe Nègre, Guilherme Perin:
Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS. ACISP 2015: 107-124 - [c20]Christophe Nègre, Thomas Plantard
Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand. ARITH 2015: 144-151 - [c19]Christophe Nègre, Jean-Marc Robert:
Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve. SECRYPT 2015: 202-209 - 2014
- [j15]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) - [j14]Christophe Nègre:
Efficient binary polynomial multiplication based on optimized Karatsuba reconstruction. J. Cryptogr. Eng. 4(2): 91-106 (2014) - [j13]Murat Cenk
Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination. IEEE Trans. Computers 63(9): 2273-2287 (2014) - [c18]Kwang Ho Kim, Chol Ok Lee, Christophe Nègre:
Binary Edwards Curves Revisited. INDOCRYPT 2014: 393-408 - 2013
- [j12]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) - [j11]Murat Cenk
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products. IEEE Trans. Computers 62(7): 1345-1361 (2013) - [j10]M. Anwar Hasan, Christophe Nègre:
Multiway Splitting Method for Toeplitz Matrix Vector Product. IEEE Trans. Computers 62(7): 1467-1471 (2013) - [c17]Christophe Nègre, Jean-Marc Robert:
Impact of Optimized Field Operations AB, AC and AB + CD in Scalar Multiplication over Binary Elliptic Curve. AFRICACRYPT 2013: 279-296 - 2012
- [j9]M. Anwar Hasan, Christophe Nègre:
Sequential multiplier with sub-linear gate complexity. J. Cryptogr. Eng. 2(2): 91-97 (2012) - [j8]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): 151-163 (2012) - [j7]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): 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 Méloni, Christophe Nègre, M. Anwar Hasan:
High performance GHASH and impacts of a class of unconventional bases. J. Cryptogr. Eng. 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
Improved Three-Way Split Formulas for Binary Polynomial Multiplication. Selected Areas in Cryptography 2011: 384-398 - 2010
- [j4]Jean-Claude Bajard
Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. IEEE Trans. Computers 59(12): 1585-1597 (2010) - [c14]Nicolas Méloni, Christophe Nègre, M. Anwar Hasan:
High Performance GHASH Function for Long Messages. ACNS 2010: 154-167
2000 – 2009
- 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 Their Appl. 13(3): 635-647 (2007) - [j2]Christophe Nègre:
Efficient parallel multiplier in shifted polynomial basis. J. Syst. Archit. 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
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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-07 00:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: