Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
EDBT 2026 Demo / reviewers in the wild / expert

Edlyn Teske

dblp:31/5407 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 4 · 1 first-authorTheory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography		 0.222010
A Taxonomy of Pairing-Friendly Elliptic Curves · J. Cryptol. 2010
An Elliptic Curve Trapdoor System · J. Cryptol. 2006
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
pairing-friendly curves		 0.112010
A Taxonomy of Pairing-Friendly Elliptic Curves · J. Cryptol. 2010
Cryptographic primitives and cryptanalysis
public-key cryptography		 0.112006
An Elliptic Curve Trapdoor System · J. Cryptol. 2006

Methods — techniques the papers use, named apart from their topics

elliptic curve construction · 0.1
YearPublicationVenuePosition
2010 A Taxonomy of Pairing-Friendly Elliptic Curves
abstract
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairing-based cryptographic systems. Such “pairing-friendly” curves are rare and thus require specific constructions. In this paper we give a single coherent framework that encompasses all of the constructions of pairing-friendly elliptic curves currently existing in the literature. We also include new constructions of pairing-friendly curves that improve on the previously known constructions for certain embedding degrees. Finally, for all embedding degrees up to 50, we provide recommendations as to which pairing-friendly curves to choose to best satisfy a variety of performance and security requirements.
David Mandell Freeman, Michael Scott, Edlyn Teske
 J. Cryptol.3
2006 An Elliptic Curve Trapdoor System
Edlyn Teske
 J. Cryptol.1
2004 Weak Fields for ECC
Alfred Menezes, Edlyn Teske, Annegret Weng
 CT-RSA2
2003 Computing discrete logarithms with the parallelized kangaroo method,
Edlyn Teske
 Discret. Appl. Math.1
2000 Analysis of the Xedni Calculus Attack
Michael J. Jacobson Jr., Neal Koblitz, Joseph H. Silverman, Andreas Stein, Edlyn Teske
 Des. Codes Cryptogr.5
1999 The Pohlig-Hellman Method Generalized for Group Structure Computation
Edlyn Teske
 J. Symb. Comput.1