default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Thériault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Roger Oyono, Nicolas Thériault
:
Index calculus algorithm for non-planar curves. Finite Fields Their Appl. 90: 102227 (2023)- 2020
- [j11]Rodrigo Abarzúa, Santi Martínez, Valeria Mendoza, Nicolas Thériault:
Same value analysis on Edwards curves. J. Cryptogr. Eng. 10(1): 27-48 (2020)
2010 – 2019
- 2019
- [e1]Peter Schwabe, Nicolas Thériault:
Progress in Cryptology - LATINCRYPT 2019 - 6th International Conference on Cryptology and Information Security in Latin America, Santiago de Chile, Chile, October 2-4, 2019, Proceedings. Lecture Notes in Computer Science 11774, Springer 2019, ISBN 978-3-030-30529-1 [contents] - 2018
- [j10]Edgardo Riquelme, Nicolas Thériault:
Symbolic Trisection Polynomials for Genus 2 Curves in Odd Characteristic. SIAM J. Discret. Math. 32(4): 2421-2440 (2018) - 2017
- [c10]Cristobal Leiva, Nicolas Thériault:
Optimal 2-3 Chains for Scalar Multiplication. LATINCRYPT 2017: 89-108 - 2016
- [j9]Jordi Pujolàs, Edgardo Riquelme, Nicolas Thériault:
Trisection for non-supersingular genus 2 curves in characteristic 2. Int. J. Comput. Math. 93(8): 1254-1264 (2016) - 2015
- [j8]Josep M. Miret, Jordi Pujolàs, Nicolas Thériault:
Bisection and squares in genus 2. Finite Fields Their Appl. 36: 170-188 (2015) - [c9]Alex Capuñay Gonzales, Nicolas Thériault:
Computing Optimal 2-3 Chains for Pairings. LATINCRYPT 2015: 225-244 - 2014
- [j7]Josep M. Miret, Jordi Pujolàs, Nicolas Thériault:
Trisection for supersingular genus 2 curves in characteristic 2. Adv. Math. Commun. 8(4): 375-387 (2014) - 2013
- [j6]Roger Oyono, Nicolas Thériault:
Group arithmetic in C3, 5C3, 5 curves. J. Symb. Comput. 56: 1-26 (2013) - [p1]Nicolas Thériault:
Hyperelliptic curve cryptographic systems. Handbook of Finite Fields 2013: 797-803 - 2012
- [c8]Rodrigo Abarzúa, Nicolas Thériault:
Complete Atomic Blocks for Elliptic Curves in Jacobian Coordinates over Prime Fields. LATINCRYPT 2012: 37-55 - 2011
- [r5]Roberto Avanzi, Nicolas Thériault:
Hyperelliptic Curve Security. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 573-576 - [r4]Roberto Avanzi, Nicolas Thériault:
Hyperelliptic Curves. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 576-580 - [r3]Roberto Avanzi, Nicolas Thériault:
Hyperelliptic Curves Performance. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 580-582 - 2010
- [j5]Peter Birkner, Nicolas Thériault:
Efficient halving for genus 3 curves over binary fields. Adv. Math. Commun. 4(1): 23-47 (2010) - [j4]Rodrigo Abarzúa, Nicolas Thériault, Roberto Avanzi, Ismael Soto, Miguel D. Alfaro:
Optimization of the arithmetic of the ideal class group for genus 4 hyperelliptic curves over projective coordinates. Adv. Math. Commun. 4(2): 115-139 (2010) - [j3]Roberto Avanzi, Nicolas Thériault:
A filtering method for the hyperelliptic curve index calculus and its analysis. Adv. Math. Commun. 4(2): 189-213 (2010)
2000 – 2009
- 2009
- [i4]Peter Birkner, Nicolas Thériault:
Efficient Halving for Genus 3 Curves over Binary Fields. IACR Cryptol. ePrint Arch. 2009: 157 (2009) - 2008
- [j2]Roberto Avanzi, Nicolas Thériault, Zheng Wang:
Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ. J. Math. Cryptol. 2(3): 227-255 (2008) - [c7]Peter Birkner, Nicolas Thériault:
Faster Halvings in Genus 2. Selected Areas in Cryptography 2008: 1-17 - 2007
- [j1]Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem:
A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. 76(257): 475-492 (2007) - [c6]Robert Granger, Florian Hess, Roger Oyono, Nicolas Thériault, Frederik Vercauteren:
Ate Pairing on Hyperelliptic Curves. EUROCRYPT 2007: 430-447 - [c5]K. Gopalakrishnan, Nicolas Thériault, Chui Zhi Yao:
Solving Discrete Logarithms from Partial Knowledge of the Key. INDOCRYPT 2007: 224-237 - [c4]Roberto Maria Avanzi, Nicolas Thériault:
Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic. WAIFI 2007: 69-84 - 2006
- [c3]Douglas Stebila, Nicolas Thériault:
Unified Point Addition Formulæ and Side-Channel Attacks. CHES 2006: 354-368 - 2005
- [c2]Nicolas Thériault:
SPA Resistant Left-to-Right Integer Recodings. Selected Areas in Cryptography 2005: 345-358 - [r2]Roberto Maria Avanzi, Nicolas Thériault:
Index Calculus. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 495-509 - [r1]Roberto Maria Avanzi, Nicolas Thériault:
Index Calculus for Hyperelliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 511-527 - [i3]Nicolas Thériault:
SPA Resistant Left-to-Right Integer Recodings. IACR Cryptol. ePrint Arch. 2005: 125 (2005) - [i2]Douglas Stebila, Nicolas Thériault:
Unified Point Addition Formulæ and Side-Channel Attacks. IACR Cryptol. ePrint Arch. 2005: 419 (2005) - 2004
- [i1]Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem:
A double large prime variation for small genus hyperelliptic index calculus. IACR Cryptol. ePrint Arch. 2004: 153 (2004) - 2003
- [c1]Nicolas Thériault:
Index Calculus Attack for Hyperelliptic Curves of Small Genus. ASIACRYPT 2003: 75-92
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-03-04 21:13 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:
