default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid R. Kohel
Person information
- affiliation: University of the Mediterranean, Mathematics Institute Luminy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2012
[j4]Christophe Arene, David R. Kohel, Christophe Ritzenthaler:
Complete addition laws on abelian varieties. LMS J. Comput. Math. 15: 308-316 (2012)- 2000
- [j3]Cunsheng Ding, David R. Kohel, San Ling
:
Secret-sharing with a class of ternary codes. Theor. Comput. Sci. 246(1-2): 285-298 (2000) - [j2]Cunsheng Ding, David R. Kohel, San Ling:
Elementary 2-group character codes. IEEE Trans. Inf. Theory 46(1): 280-284 (2000) - [j1]Cunsheng Ding, David R. Kohel, San Ling:
Split group codes. IEEE Trans. Inf. Theory 46(2): 485-495 (2000)
Conference and Workshop Papers
- 2011
- [c10]Pierrick Gaudry, David R. Kohel, Benjamin A. Smith:
Counting Points on Genus 2 Curves with Real Multiplication. ASIACRYPT 2011: 504-519 - 2009
- [c9]Christophe Doche, David R. Kohel, Francesco Sica:
Double-Base Number System for Multi-scalar Multiplications. EUROCRYPT 2009: 502-517 - 2006
- [c8]Martine Girard, David R. Kohel:
Classification of Genus 3 Curves in Special Strata of the Moduli Space. ANTS 2006: 346-360 - [c7]David R. Kohel, Benjamin A. Smith:
Efficiently Computable Endomorphisms for Hyperelliptic Curves. ANTS 2006: 495-509 - [c6]Pierrick Gaudry, T. Houtmann, David R. Kohel, Christophe Ritzenthaler, A. Weng:
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography. ASIACRYPT 2006: 114-129 - [c5]Christophe Doche, Thomas Icart, David R. Kohel:
Efficient Scalar Multiplication by Isogeny Decompositions. Public Key Cryptography 2006: 191-206 - 2003
- [c4]David R. Kohel:
The AGM-X0(N) Heegner Point Lifting Algorithm and Elliptic Curve Point Counting. ASIACRYPT 2003: 124-136 - 2000
- [c3]David R. Kohel, Igor E. Shparlinski:
On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields. ANTS 2000: 395-404 - [c2]David R. Kohel, William A. Stein:
Component Groups of Quotients of J0(N). ANTS 2000: 405-412 - 1998
- [c1]David R. Kohel, San Ling, Chaoping Xing:
Explicit Sequence Expansions. SETA 1998: 308-317
Editorship
- 2002
- [e1]Claus Fieker, David R. Kohel:
Algorithmic Number Theory, 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002, Proceedings. Lecture Notes in Computer Science 2369, Springer 2002, ISBN 3-540-43863-7 [contents]
Informal and Other Publications
- 2011
- [i3]Pierrick Gaudry, David R. Kohel, Benjamin A. Smith:
Counting Points on Genus 2 Curves with Real Multiplication. IACR Cryptol. ePrint Arch. 2011: 295 (2011) - 2008
- [i2]Christophe Doche, David R. Kohel, Francesco Sica:
Double-Base Number System for Multi-Scalar Multiplications. IACR Cryptol. ePrint Arch. 2008: 388 (2008) - 2005
- [i1]Christophe Doche, Thomas Icart, David R. Kohel:
Efficient Scalar Multiplication by Isogeny Decompositions. IACR Cryptol. ePrint Arch. 2005: 420 (2005)
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-04-03 00:23 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:
