default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerhard Frey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j4]Gerhard Frey, Ernst Kani:
Normal forms of hyperelliptic curves of genus 3. Des. Codes Cryptogr. 77(2-3): 677-712 (2015)- 2014
- [p1]Gerhard Frey:
Isogenies in Theory and Praxis. Open Problems in Mathematics and Computational Science 2014: 37-68 - 2011
- [c4]Gerhard Frey, Ernst Kani:
Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm. SIIS 2011: 1-19 - 2010
- [j3]Gerhard Frey:
Relations between arithmetic geometry and public key cryptography. Adv. Math. Commun. 4(2): 281-305 (2010)
2000 – 2009
- 2006
- [c3]Gerhard Frey, Tanja Lange:
Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves. ANTS 2006: 466-479 - 2005
- [e1]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] - [r8]Gerhard Frey, Tanja Lange:
Background on Curves and Jacobians. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 45-85 - [r7]Gerhard Frey, Tanja Lange:
Varieties over Special Fields. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 87-113 - [r6]Sylvain Duquesne, Gerhard Frey:
Background on Pairings. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 115-124 - [r5]Gerhard Frey, Tanja Lange:
Background on Weil Descent. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 125-132 - [r4]Sylvain Duquesne, Gerhard Frey:
Implementation of Pairings. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 389-404 - [r3]Gerhard Frey, Tanja Lange:
Complex Multiplication. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 455-473 - [r2]Gerhard Frey, Tanja Lange:
Transfer of Discrete Logarithms. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 529-545 - [r1]Gerhard Frey, Tanja Lange:
Algebraic Realizations of DL Systems. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 546-572 - 2004
- [j2]Roberto Maria Avanzi, Gerhard Frey, Tanja Lange, Roger Oyono:
On using expansions to the base of -2. Int. J. Comput. Math. 81(4): 403-406 (2004)
1990 – 1999
- 1999
- [j1]Gerhard Frey, Michael Müller, Hans-Georg Rück:
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Trans. Inf. Theory 45(5): 1717-1719 (1999) - 1997
- [c2]Gerhard Frey, Michael Müller:
Arithmetic of Modular Curves and Applications. Algorithmic Algebra and Number Theory 1997: 11-48
1980 – 1989
- 1989
- [c1]Gerhard Frey:
Künstliche Intelligenz und Gödel-Theoreme. ÖGAI 1989: 387-396
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 23:13 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:
