Edlyn Teske

Publication Activity (10 Years)

Years Active: 1997-2013
Publications (10 Years): 0

Top Venues

IACR Cryptol. ePrint Arch.

Number Theory and Cryptography

Publications

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 (2013)
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)
David Freeman, Michael Scott, Edlyn Teske
A Taxonomy of Pairing-Friendly Elliptic Curves. J. Cryptol. 23 (2) (2010)
Jennifer S. Balakrishnan, Juliana Belding, Sarah Chisholm, Kirsten Eisenträger, Katherine E. Stange, Edlyn Teske
Pairings on hyperelliptic curves CoRR (2009)
Koray Karabina, Edlyn Teske
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6. ANTS (2008)
Koray Karabina, Edlyn Teske
On prime-order elliptic curves with embedding degrees k=3, 4 and 6. IACR Cryptol. ePrint Arch. 2007 (2007)
David Freeman, Michael Scott, Edlyn Teske
A taxonomy of pairing-friendly elliptic curves. IACR Cryptol. ePrint Arch. 2006 (2006)
Alfred Menezes, Edlyn Teske
Cryptographic implications of Hess' generalized GHS attack. Appl. Algebra Eng. Commun. Comput. 16 (6) (2006)
Edlyn Teske
An Elliptic Curve Trapdoor System. J. Cryptol. 19 (1) (2006)
Mark Bauer, Edlyn Teske, Annegret Weng
Point counting on Picard curves in large characteristic. Math. Comput. 74 (252) (2005)
Alfred Menezes, Edlyn Teske
Cryptographic Implications of Hess' Generalized GHS Attack. IACR Cryptol. ePrint Arch. 2004 (2004)
Alfred Menezes, Edlyn Teske, Annegret Weng
Weak Fields for ECC. CT-RSA (2004)
Alfred Menezes, Edlyn Teske, Annegret Weng
Weak Fields for ECC. IACR Cryptol. ePrint Arch. 2003 (2003)
Edlyn Teske
Computing discrete logarithms with the parallelized kangaroo method, . Discret. Appl. Math. 130 (1) (2003)
Edlyn Teske
An Elliptic Curve Trapdoor System. IACR Cryptol. ePrint Arch. 2003 (2003)
Andreas Stein, Edlyn Teske
Explicit bounds and heuristics on class numbers in hyperelliptic function fields. Math. Comput. 71 (238) (2002)
Peter Ebinger, Edlyn Teske
Factoring N = pq with the Elliptic Curve Method. ANTS (2002)
M. Jason Hinek, Mo King Low, Edlyn Teske
On Some Attacks on Multi-prime RSA. Selected Areas in Cryptography (2002)
Andreas Stein, Edlyn Teske
The parallelized Pollard kangaroo method in real quadratic function fields. Math. Comput. 71 (238) (2002)
M. Jason Hinek, Mo King Low, Edlyn Teske
On some Attacks on Multi-prime RSA. IACR Cryptol. ePrint Arch. 2002 (2002)
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 (2002)
Edlyn Teske
On random walks for Pollard's rho method. Math. Comput. 70 (234) (2001)
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 (2001)
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)
Simon R. Blackburn, Edlyn Teske
Baby-Step Giant-Step Algorithms for Non-uniform Distributions. ANTS (2000)
Edlyn Teske, Hugh C. Williams
A Note on Shanks's Chains of Primes. ANTS (2000)
Michael J. Jacobson Jr., Neal Koblitz, Joseph H. Silverman, Andreas Stein, Edlyn Teske
Analysis of the Xedni Calculus Attack. Des. Codes Cryptogr. 20 (1) (2000)
Edlyn Teske, Hugh C. Williams
A Problem Concerning a Character Sum. Exp. Math. 8 (1) (1999)
Edlyn Teske
The Pohlig-Hellman Method Generalized for Group Structure Computation. J. Symb. Comput. 27 (6) (1999)
Edlyn Teske
A space efficient algorithm for group structure computation. Math. Comput. 67 (224) (1998)
Edlyn Teske, Hugh C. Williams
A Problem Concerning a Character Sum - Extended Abstract. ANTS (1998)
Edlyn Teske
Speeding Up Pollard's Rho Method for Computing Discrete Logarithms. ANTS (1998)
Johannes Buchmann, Michael J. Jacobson Jr., Edlyn Teske
On some computational problems in finite abelian groups. Math. Comput. 66 (220) (1997)