default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Marc Robert 0003
Person information
- affiliation: University of Toulon, France
- affiliation: University of Perpignan, Team DALI, France
- affiliation: University of Montpellier, France
Other persons with the same name
- Jean-Marc Robert 0001
![[0000-0002-9495-8038]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-9495-8038")
— École de Technologie Supérieure (ÉTS), Montréal, QC, Canada (and 3 more) - Jean-Marc Robert 0002 — École Polytechnique de Montréal, Department of Mathematics and Industrial Engineering, QC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Laurent-Stéphane Didier, Nadia El Mrabet, Léa Glandus, Jean-Marc Robert:
Truncated multiplication and batch software SIMD AVX512 implementation for faster Montgomery multiplications and modular exponentiation. IACR Commun. Cryptol. 1(3): 11 (2024)- [i2]Laurent-Stéphane Didier, Nadia El Mrabet, Léa Glandus, Jean-Marc Robert:
Truncated multiplication and batch software SIMD AVX512 implementation for faster Montgomery multiplications and modular exponentiation. CoRR abs/2410.18129 (2024) - 2023
- [j4]Jean-Marc Robert, Pascal Véron:
Faster multiplication over ${\mathbb {F}}_2[X]$ using AVX512 instruction set and VPCLMULQDQ instruction. J. Cryptogr. Eng. 13(1): 37-55 (2023) - 2022
- [j3]Fangan-Yssouf Dosso, Jean-Marc Robert, Pascal Véron:
PMNS for Efficient Arithmetic and Small Memory Cost. IEEE Trans. Emerg. Top. Comput. 10(3): 1263-1277 (2022) - [c7]Fangan-Yssouf Dosso, Jean-Marc Robert, Pascal Véron:
PMNS for efficient arithmetic and small memory cost. ARITH 2022: 84 - [c6]Laurent-Stéphane Didier, Jean-Marc Robert, Fangan-Yssouf Dosso, Nadia El Mrabet:
A software comparison of RNS and PMNS. ARITH 2022: 86-93 - [i1]Jean-Marc Robert, Pascal Véron:
Faster multiplication over F2[X] using AVX512 instruction set and VPCLMULQDQ instruction. CoRR abs/2201.10473 (2022)
2010 – 2019
- 2019
- [j2]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) - 2016
- [c5]Thomas Plantard, Jean-Marc Robert:
Enhanced Digital Signature Using RNS Digit Exponent Representation. WAIFI 2016: 177-192 - 2015
- [b1]Jean-Marc Robert:
Contrer l'attaque Simple Power Analysis efficacement dans les applications de la cryptographie asymétrique, algorithmes et implantations. (Thwart simple power analysis efficiently in asymmetric cryptographic applications, algorithms and implementations). University of Perpignan, France, 2015 - [j1]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) - [c4]Christophe Nègre, Thomas Plantard, Jean-Marc Robert:
Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand. ARITH 2015: 144-151 - [c3]Christophe Nègre, Jean-Marc Robert:
Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve. SECRYPT 2015: 202-209 - 2014
- [c2]Jean-Marc Robert:
Parallelized Software Implementation of Elliptic Curve Scalar Multiplication. Inscrypt 2014: 445-462 - 2013
- [c1]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
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 2025-01-04 03:25 CET 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:
