default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2005
- Henri Cohen, Gerhard Frey, Roberto Avanzi, Christophe Doche, Tanja Lange, Kim Nguyen, Frederik Vercauteren:
Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman and Hall/CRC 2005, ISBN 978-1-58488-518-4 [contents] - Roberto Maria Avanzi:
Generic Algorithms for Computing Discrete Logarithms. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 476-494 - Roberto Maria Avanzi, Henri Cohen:
Compositeness and Primality Testing Factoring. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 591-614 - Roberto Maria Avanzi, Tanja Lange:
Introduction to Public-Key Cryptography. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 1-15 - Roberto Maria Avanzi, Nicolas Thériault:
Index Calculus. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 495-509 - Roberto Maria Avanzi, Nicolas Thériault:
Index Calculus for Hyperelliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 511-527 - Bertrand Byramjee, Jean-Christophe Courrège, Benoit Feix:
Practical Attacks on Smart Cards. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 669-685 - Bertrand Byramjee, Andrew Weigl:
Smart Cards. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 647-667 - Christophe Doche:
Exponentiation. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 144-168 - Christophe Doche:
Integer Arithmetic. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 169-199 - Christophe Doche:
Finite Field Arithmetic. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 201-237 - Christophe Doche, David Lubicz:
Algebraic Background. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 18-37 - Christophe Doche, Tanja Lange:
Arithmetic of Elliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 267-302 - Christophe Doche, Tanja Lange:
Arithmetic of Special Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 355-387 - Sylvain Duquesne, Gerhard Frey:
Background on Pairings. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 115-124 - Sylvain Duquesne, Gerhard Frey:
Implementation of Pairings. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 389-404 - Sylvain Duquesne, Tanja Lange:
Arithmetic of Hyperelliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 303-353 - Sylvain Duquesne, Tanja Lange:
Pairing-Based Cryptography. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 573-590 - Gerhard Frey, Tanja Lange:
Background on Curves and Jacobians. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 45-85 - Gerhard Frey, Tanja Lange:
Varieties over Special Fields. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 87-113 - Gerhard Frey, Tanja Lange:
Background on Weil Descent. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 125-132 - Gerhard Frey, Tanja Lange:
Complex Multiplication. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 455-473 - Gerhard Frey, Tanja Lange:
Transfer of Discrete Logarithms. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 529-545 - Gerhard Frey, Tanja Lange:
Algebraic Realizations of DL Systems. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 546-572 - Tanja Lange:
Mathematical Countermeasures against Side-Channel Attacks. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 687-714 - Tanja Lange, David Lubicz, Andrew Weigl:
Random Numbers Generation and Testing. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 715-735 - Reynald Lercier, David Lubicz, Frederik Vercauteren:
Point Counting on Elliptic and Hyperelliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 406-453 - David Lubicz:
Background on p-adic Numbers. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 39-44 - David Lubicz, Frederik Vercauteren:
Cohomological Background on Point Counting. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 133-141 - Kim Nguyen, Andrew Weigl:
Fast Arithmetic in Hardware. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 616-646
skipping 2 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-21 01:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint