Edlyn Teske

1.4k total citations
14 papers, 367 citations indexed

About

Edlyn Teske is a scholar working on Information Systems, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Edlyn Teske has authored 14 papers receiving a total of 367 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Information Systems, 9 papers in Artificial Intelligence and 6 papers in Geometry and Topology. Recurrent topics in Edlyn Teske's work include Cryptography and Residue Arithmetic (11 papers), Coding theory and cryptography (9 papers) and Algebraic Geometry and Number Theory (6 papers). Edlyn Teske is often cited by papers focused on Cryptography and Residue Arithmetic (11 papers), Coding theory and cryptography (9 papers) and Algebraic Geometry and Number Theory (6 papers). Edlyn Teske collaborates with scholars based in Canada, Germany and United States. Edlyn Teske's co-authors include David Mandell Freeman, Michael Scott, Andreas Stein, Michael J. Jacobson, Alfred Menezes, Johannes Buchmann, Markus Maurer, Neal Koblitz, Joseph H. Silverman and Annegret Weng and has published in prestigious journals such as Mathematics of Computation, Discrete Applied Mathematics and Journal of Cryptology.

In The Last Decade

Edlyn Teske

14 papers receiving 326 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Edlyn Teske Canada	10	297	261	87	85	41	14	367
Victor S. Miller United States	4	249 0.8×	204 0.8×	56 0.6×	67 0.8×	27 0.7×	8	307
Andreas Enge France	9	207 0.7×	189 0.7×	72 0.8×	111 1.3×	33 0.8×	20	281
Hans-Georg Rück Germany	10	417 1.4×	314 1.2×	58 0.7×	201 2.4×	47 1.1×	15	530
Emmanuel Thomé France	8	133 0.4×	122 0.5×	58 0.7×	56 0.7×	16 0.4×	20	194
David Mandell Freeman United States	5	193 0.6×	194 0.7×	32 0.4×	31 0.4×	16 0.4×	6	273
Jonathan Sorenson United States	9	146 0.5×	93 0.4×	80 0.9×	42 0.5×	20 0.5×	25	222
I. Onyszchuk United States	6	320 1.1×	265 1.0×	54 0.6×	13 0.2×	30 0.7×	12	388
Maozhi Xu China	10	211 0.7×	117 0.4×	39 0.4×	25 0.3×	38 0.9×	53	291
Shuqin Fan China	11	280 0.9×	106 0.4×	55 0.6×	40 0.5×	22 0.5×	26	313
Claus Diem Germany	6	102 0.3×	98 0.4×	41 0.5×	54 0.6×	19 0.5×	14	167

Countries citing papers authored by Edlyn Teske

Since Specialization

Citations

This map shows the geographic impact of Edlyn Teske's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Edlyn Teske with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Edlyn Teske more than expected).

Fields of papers citing papers by Edlyn Teske

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Edlyn Teske. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Edlyn Teske. The network helps show where Edlyn Teske may publish in the future.

Co-authorship network of co-authors of Edlyn Teske

This figure shows the co-authorship network connecting the top 25 collaborators of Edlyn Teske. A scholar is included among the top collaborators of Edlyn Teske based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Edlyn Teske. Edlyn Teske is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

14 of 14 papers shown

Freeman, David Mandell, Michael Scott, & Edlyn Teske. (2009). A Taxonomy of Pairing-Friendly Elliptic Curves. Journal of Cryptology. 23(2). 224–280. 163 indexed citations

Teske, Edlyn, et al.. (2005). Point counting on Picard curves in large characteristic. Mathematics of Computation. 74(252). 1983–2006. 6 indexed citations

Teske, Edlyn. (2005). An Elliptic Curve Trapdoor System. Journal of Cryptology. 19(1). 115–133. 20 indexed citations

Menezes, Alfred & Edlyn Teske. (2005). Cryptographic implications of Hess' generalized GHS attack. Applicable Algebra in Engineering Communication and Computing. 16(6). 439–460. 9 indexed citations

Stein, Andreas & Edlyn Teske. (2005). Optimized Baby Step-Giant Step Methods. 2 indexed citations

Teske, Edlyn. (2003). Computing discrete logarithms with the parallelized kangaroo method. Discrete Applied Mathematics. 130(1). 61–82. 6 indexed citations

Maurer, Markus, Alfred Menezes, & Edlyn Teske. (2002). Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree. LMS Journal of Computation and Mathematics. 5. 127–174. 16 indexed citations

Stein, Andreas & Edlyn Teske. (2001). The parallelized Pollard kangaroo method in real quadratic function fields. Mathematics of Computation. 71(238). 793–815. 10 indexed citations

Stein, Andreas & Edlyn Teske. (2001). Explicit bounds and heuristics on class numbers in hyperelliptic function fields. Mathematics of Computation. 71(238). 837–862. 14 indexed citations

10.

Teske, Edlyn. (2000). On random walks for Pollard's rho method. Mathematics of Computation. 70(234). 809–826. 53 indexed citations

11.

Jacobson, Michael J., et al.. (2000). Analysis of the Xedni Calculus Attack. Designs Codes and Cryptography. 20(1). 41–64. 25 indexed citations

12.

Teske, Edlyn. (1999). The Pohlig–Hellman Method Generalized for Group Structure Computation. Journal of Symbolic Computation. 27(6). 521–534. 8 indexed citations

13.

Teske, Edlyn. (1998). A space efficient algorithm for group structure computation. Mathematics of Computation. 67(224). 1637–1663. 14 indexed citations

14.

Buchmann, Johannes, Michael J. Jacobson, & Edlyn Teske. (1997). On some computational problems in finite abelian groups. Mathematics of Computation. 66(220). 1663–1687. 21 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact