default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdlyn Teske
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c10]Michael Shantz, Edlyn Teske:
Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods - An Experimental Study. Number Theory and Cryptography 2013: 94-107- [i9]Michael Shantz, Edlyn Teske:
Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods - an Experimental Study. IACR Cryptol. ePrint Arch. 2013: 596 (2013) - 2011
- [p1]Jennifer S. Balakrishnan, Juliana Belding, Sarah Chisholm, Kirsten Eisenträger, Katherine E. Stange, Edlyn Teske:
Pairings on Hyperelliptic Curves. WIN - Women in Numbers 2011: 87-120 - [r1]Edlyn Teske:
Pairing-Friendly Elliptic Curves. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 904-907 - 2010
- [j14]David Freeman, Michael Scott, Edlyn Teske:
A Taxonomy of Pairing-Friendly Elliptic Curves. J. Cryptol. 23(2): 224-280 (2010)
2000 – 2009
- 2009
- [i8]Jennifer S. Balakrishnan, Juliana Belding, Sarah Chisholm, Kirsten Eisenträger, Katherine E. Stange, Edlyn Teske:
Pairings on hyperelliptic curves. CoRR abs/0908.3731 (2009) - 2008
- [c9]Koray Karabina, Edlyn Teske:
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6. ANTS 2008: 102-117 - 2007
- [i7]Koray Karabina, Edlyn Teske:
On prime-order elliptic curves with embedding degrees k=3, 4 and 6. IACR Cryptol. ePrint Arch. 2007: 425 (2007) - 2006
- [j13]Alfred Menezes, Edlyn Teske:
Cryptographic implications of Hess' generalized GHS attack. Appl. Algebra Eng. Commun. Comput. 16(6): 439-460 (2006) - [j12]Edlyn Teske:
An Elliptic Curve Trapdoor System. J. Cryptol. 19(1): 115-133 (2006) - [i6]David Freeman, Michael Scott, Edlyn Teske:
A taxonomy of pairing-friendly elliptic curves. IACR Cryptol. ePrint Arch. 2006: 372 (2006) - 2005
- [j11]Mark Bauer, Edlyn Teske, Annegret Weng:
Point counting on Picard curves in large characteristic. Math. Comput. 74(252): 1983-2005 (2005) - 2004
- [c8]Alfred Menezes, Edlyn Teske, Annegret Weng:
Weak Fields for ECC. CT-RSA 2004: 366-386 - [i5]Alfred Menezes, Edlyn Teske:
Cryptographic Implications of Hess' Generalized GHS Attack. IACR Cryptol. ePrint Arch. 2004: 235 (2004) - 2003
- [j10]Edlyn Teske:
Computing discrete logarithms with the parallelized kangaroo method, . Discret. Appl. Math. 130(1): 61-82 (2003) - [i4]Edlyn Teske:
An Elliptic Curve Trapdoor System. IACR Cryptol. ePrint Arch. 2003: 58 (2003) - [i3]Alfred Menezes, Edlyn Teske, Annegret Weng:
Weak Fields for ECC. IACR Cryptol. ePrint Arch. 2003: 128 (2003) - 2002
- [j9]Markus Maurer, Alfred Menezes, Edlyn Teske:
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree. LMS J. Comput. Math. 5: 127-174 (2002) - [j8]Andreas Stein, Edlyn Teske:
The parallelized Pollard kangaroo method in real quadratic function fields. Math. Comput. 71(238): 793-814 (2002) - [j7]Andreas Stein, Edlyn Teske:
Explicit bounds and heuristics on class numbers in hyperelliptic function fields. Math. Comput. 71(238): 837-861 (2002) - [c7]Peter Ebinger
, Edlyn Teske:
Factoring N = pq with the Elliptic Curve Method. ANTS 2002: 475-490 - [c6]M. Jason Hinek, Mo King Low, Edlyn Teske:
On Some Attacks on Multi-prime RSA. Selected Areas in Cryptography 2002: 385-404 - [i2]M. Jason Hinek, Mo King Low, Edlyn Teske:
On some Attacks on Multi-prime RSA. IACR Cryptol. ePrint Arch. 2002: 63 (2002) - 2001
- [j6]Edlyn Teske:
On random walks for Pollard's rho method. Math. Comput. 70(234): 809-825 (2001) - [c5]Markus Maurer, Alfred Menezes, Edlyn Teske:
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree. INDOCRYPT 2001: 195-213 - [i1]Markus Maurer, Alfred Menezes, Edlyn Teske:
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree. IACR Cryptol. ePrint Arch. 2001: 84 (2001) - 2000
- [j5]Michael J. Jacobson Jr., Neal Koblitz, Joseph H. Silverman, Andreas Stein, Edlyn Teske:
Analysis of the Xedni Calculus Attack. Des. Codes Cryptogr. 20(1): 1-64 (2000) - [c4]Simon R. Blackburn, Edlyn Teske:
Baby-Step Giant-Step Algorithms for Non-uniform Distributions. ANTS 2000: 153-168 - [c3]Edlyn Teske, Hugh C. Williams:
A Note on Shanks's Chains of Primes. ANTS 2000: 563-580
1990 – 1999
- 1999
- [j4]Edlyn Teske, Hugh C. Williams:
A Problem Concerning a Character Sum. Exp. Math. 8(1): 63-72 (1999) - [j3]Edlyn Teske:
The Pohlig-Hellman Method Generalized for Group Structure Computation. J. Symb. Comput. 27(6): 521-534 (1999) - 1998
- [j2]Edlyn Teske:
A space efficient algorithm for group structure computation. Math. Comput. 67(224): 1637-1663 (1998) - [c2]Edlyn Teske, Hugh C. Williams:
A Problem Concerning a Character Sum - Extended Abstract. ANTS 1998: 351-357 - [c1]Edlyn Teske:
Speeding Up Pollard's Rho Method for Computing Discrete Logarithms. ANTS 1998: 541-554 - 1997
- [j1]Johannes Buchmann, Michael J. Jacobson Jr., Edlyn Teske:
On some computational problems in finite abelian groups. Math. Comput. 66(220): 1663-1687 (1997)
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-01-07 01:27 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:
