default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvain Duquesne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[e2]Nadia El Mrabet
, Luca De Feo, Sylvain Duquesne:
Progress in Cryptology - AFRICACRYPT 2023 - 14th International Conference on Cryptology in Africa, Sousse, Tunisia, July 19-21, 2023, Proceedings. Lecture Notes in Computer Science 14064, Springer 2023, ISBN 978-3-031-37678-8 [contents]- 2022
- [c11]Sylvain Duquesne:
Finite Field Arithmetic in Large Characteristic for Classical and Post-quantum Cryptography. WAIFI 2022: 79-106 - 2021
- [j12]Jean-Claude Bajard, Sylvain Duquesne:
Montgomery-friendly primes and applications to cryptography. J. Cryptogr. Eng. 11(4): 399-415 (2021) - 2020
- [c10]Rémi Clarisse, Sylvain Duquesne, Olivier Sanders:
Curves with Fast Computations in the First Pairing Group. CANS 2020: 280-298 - [i12]Jean-Claude Bajard, Sylvain Duquesne:
Montgomery-friendly primes and applications to cryptography. IACR Cryptol. ePrint Arch. 2020: 665 (2020) - [i11]Remi Clarisse, Sylvain Duquesne, Olivier Sanders:
Curves with fast computations in the first pairing group. IACR Cryptol. ePrint Arch. 2020: 760 (2020)
2010 – 2019
- 2019
- [j11]Razvan Barbulescu, Sylvain Duquesne:
Updating Key Size Estimations for Pairings. J. Cryptol. 32(4): 1298-1336 (2019) - 2018
- [j10]Sylvain Duquesne, Nadia El Mrabet, Safia Haloui, Franck Rondepierre:
Choosing and generating parameters for pairing implementation on BN curves. Appl. Algebra Eng. Commun. Comput. 29(2): 113-147 (2018) - [j9]Anissa Sghaier, Zeghid Medien, Loubna Ghammam, Sylvain Duquesne, Mohsen Machhout, Hassan Yousif Ahmed:
High speed and efficient area optimal ate pairing processor implementation over BN and BLS12 curves on FPGA. Microprocess. Microsystems 61: 227-241 (2018) - [c9]Yoshinori Uetake, Akihiro Sanada, Takuya Kusaka, Yasuyuki Nogami, Leo Weissbart, Sylvain Duquesne:
Side-Channel Attack using Order 4 Element against Curve25519 on ATmega328P. ISITA 2018: 618-622 - 2017
- [c8]Takuya Kusaka, Sho Joichi, Ken Ikuta, Md. Al-Amin Khandaker, Yasuyuki Nogami, Satoshi Uehara, Nariyoshi Yamai, Sylvain Duquesne:
Solving 114-Bit ECDLP for a Barreto-Naehrig Curve. ICISC 2017: 231-244 - [c7]Md. Al-Amin Khandaker, Yuki Nanjo, Loubna Ghammam, Sylvain Duquesne, Yasuyuki Nogami, Yuta Kodera:
Efficient Optimal Ate Pairing at 128-Bit Security Level. INDOCRYPT 2017: 186-205 - [i10]Razvan Barbulescu, Sylvain Duquesne:
Updating key size estimations for pairings. IACR Cryptol. ePrint Arch. 2017: 334 (2017) - [i9]Md. Al-Amin Khandaker, Yuki Nanjo, Loubna Ghammam, Sylvain Duquesne, Yasuyuki Nogami, Yuta Kodera:
Efficient Optimal Ate Pairing at 128-bit Security Level. IACR Cryptol. ePrint Arch. 2017: 1174 (2017) - 2016
- [j8]Sylvain Duquesne, Loubna Ghammam:
Memory-saving computation of the pairing final exponentiation on BN curves. Groups Complex. Cryptol. 8(1): 75-90 (2016) - [j7]Shoma Kajitani, Yasuyuki Nogami, Shunsuke Miyoshi, Thomas H. Austin, Md. Al-Amin Khandaker, Nasima Begum, Sylvain Duquesne:
Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem. Int. J. Netw. Comput. 6(2): 181-194 (2016) - [c6]Md. Al-Amin Khandaker, Hirotaka Ono, Yasuyuki Nogami, Masaaki Shirase, Sylvain Duquesne:
An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication. ICISC 2016: 208-219 - [c5]Md. Al-Amin Khandaker, Yasuyuki Nogami, Hwajeong Seo, Sylvain Duquesne:
Efficient Scalar Multiplication for Ate Based Pairing over KSS Curve of Embedding Degree 18. WISA 2016: 221-232 - [e1]Sylvain Duquesne, Svetla Petkova-Nikova:
Arithmetic of Finite Fields - 6th International Workshop, WAIFI 2016, Ghent, Belgium, July 13-15, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10064, 2016, ISBN 978-3-319-55226-2 [contents] - 2015
- [i8]Sylvain Duquesne, Loubna Ghammam:
Memory-saving computation of the pairing fi nal exponentiation on BN curves. IACR Cryptol. ePrint Arch. 2015: 192 (2015) - [i7]Anissa Sghaier, Loubna Ghammam, Zeghid Medien, Sylvain Duquesne, Mohsen Machhout:
Area-Efficient Hardware Implementation of the Optimal Ate Pairing over BN curves. IACR Cryptol. ePrint Arch. 2015: 1100 (2015) - [i6]Sylvain Duquesne, Nadia El Mrabet, Safia Haloui, Franck Rondepierre:
Choosing and generating parameters for low level pairing implementation on BN curves. IACR Cryptol. ePrint Arch. 2015: 1212 (2015) - 2014
- [j6]Sylvain Duquesne, Nadia El Mrabet, Emmanuel Fouotsa:
Efficient computation of pairings on Jacobi quartic elliptic curves. J. Math. Cryptol. 8(4): 331-362 (2014) - 2013
- [i5]Sylvain Duquesne, Nadia El Mrabet, Emmanuel Fouotsa:
Efficient Pairings Computation on Jacobi Quartic Elliptic Curves. IACR Cryptol. ePrint Arch. 2013: 597 (2013) - 2012
- [c4]Sylvain Duquesne, Emmanuel Fouotsa:
Tate Pairing Computation on Jacobi's Elliptic Curves. Pairing 2012: 254-269 - 2011
- [j5]Sylvain Duquesne:
RNS arithmetic in pk and application to fast pairing computation. J. Math. Cryptol. 5(1): 51-88 (2011) - [c3]Ray C. C. Cheung, Sylvain Duquesne, Junfeng Fan, Nicolas Guillermin, Ingrid Verbauwhede, Gavin Xiaoxu Yao:
FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction. CHES 2011: 421-441 - [i4]Sylvain Duquesne, Nicolas Guillermin:
A FPGA pairing implementation using the Residue Number System. IACR Cryptol. ePrint Arch. 2011: 176 (2011) - 2010
- [j4]Sylvain Duquesne:
Traces of the Group Law on the Kummer Surface of a Curve of Genus 2 in Characteristic 2. Math. Comput. Sci. 3(2): 173-183 (2010) - [i3]Jean-Claude Bajard, Sylvain Duquesne, Milos D. Ercegovac:
Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation. IACR Cryptol. ePrint Arch. 2010: 311 (2010) - [i2]Sylvain Duquesne:
RNS arithmetic in Fpk and application to fast pairing computation. IACR Cryptol. ePrint Arch. 2010: 555 (2010)
2000 – 2009
- 2008
- [c2]Sylvain Duquesne:
Montgomery Ladder for All Genus 2 Curves in Characteristic 2. WAIFI 2008: 174-188 - 2007
- [j3]Sylvain Duquesne:
Improving the arithmetic of elliptic curves in the Jacobi model. Inf. Process. Lett. 104(3): 101-105 (2007) - 2005
- [r4]Sylvain Duquesne, Gerhard Frey:
Background on Pairings. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 115-124 - [r3]Sylvain Duquesne, Tanja Lange:
Arithmetic of Hyperelliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 303-353 - [r2]Sylvain Duquesne, Gerhard Frey:
Implementation of Pairings. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 389-404 - [r1]Sylvain Duquesne, Tanja Lange:
Pairing-Based Cryptography. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 573-590 - 2004
- [c1]Sylvain Duquesne:
Montgomery Scalar Multiplication for Genus 2 Curves. ANTS 2004: 153-168 - [i1]Bertrand Byramjee, Sylvain Duquesne:
Classification of genus 2 curves over F2n and optimization of their arithmetic. IACR Cryptol. ePrint Arch. 2004: 107 (2004) - 2003
- [j2]Christophe Delaunay, Sylvain Duquesne:
Numerical Investigations Related to the Derivatives of the L-Series of Certain Elliptic Curves. Exp. Math. 12(3): 311-317 (2003) - 2001
- [j1]Sylvain Duquesne:
Integral Points on Elliptic Curves Defined by Simplest Cubic Fields. Exp. Math. 10(1): 91-102 (2001)
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-04-24 22:57 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:
