Edlyn Teske

According to our database, Edlyn Teske authored at least 26 papers between 1997 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods - an Experimental Study.

Michael Shantz, Edlyn Teske

IACR Cryptol. ePrint Arch., 2013

2011

Pairing-Friendly Elliptic Curves.

Edlyn Teske

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Pairings on Hyperelliptic Curves.

Jennifer S. Balakrishnan, Juliana Belding, Sarah Chisholm, Kirsten Eisenträger, Katherine E. Stange, Edlyn Teske

Proceedings of the WIN - Women in Numbers - Research Directions in Number Theory., 2011

2010

A Taxonomy of Pairing-Friendly Elliptic Curves.

David Freeman, Michael Scott, Edlyn Teske

J. Cryptol., 2010

2009

Pairings on hyperelliptic curves

Jennifer S. Balakrishnan, Juliana Belding, Sarah Chisholm, Kirsten Eisenträger, Katherine E. Stange, Edlyn Teske

CoRR, 2009

2007

On prime-order elliptic curves with embedding degrees k=3, 4 and 6.

Koray Karabina, Edlyn Teske

IACR Cryptol. ePrint Arch., 2007

2006

An Elliptic Curve Trapdoor System.

Edlyn Teske

J. Cryptol., 2006

Cryptographic implications of Hess' generalized GHS attack.

Alfred Menezes, Edlyn Teske

Appl. Algebra Eng. Commun. Comput., 2006

2005

Point counting on Picard curves in large characteristic.

Mark Bauer, Edlyn Teske, Annegret Weng

Math. Comput., 2005

2003

Weak Fields for ECC.

Alfred Menezes, Edlyn Teske, Annegret Weng

IACR Cryptol. ePrint Arch., 2003

Computing discrete logarithms with the parallelized kangaroo method, .

Edlyn Teske

Discret. Appl. Math., 2003

2002

Explicit bounds and heuristics on class numbers in hyperelliptic function fields.

Andreas Stein, Edlyn Teske

Math. Comput., 2002

The parallelized Pollard kangaroo method in real quadratic function fields.

Andreas Stein, Edlyn Teske

Math. Comput., 2002

Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree.

Markus Maurer, Alfred Menezes, Edlyn Teske

LMS J. Comput. Math., 2002

On some Attacks on Multi-prime RSA.

M. Jason Hinek, Mo King Low, Edlyn Teske

IACR Cryptol. ePrint Arch., 2002

Factoring N = pq with the Elliptic Curve Method.

Peter Ebinger, Edlyn Teske

Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001

On random walks for Pollard's rho method.

Edlyn Teske

Math. Comput., 2001

2000

Analysis of the Xedni Calculus Attack.

Michael J. Jacobson Jr., Neal Koblitz, Joseph H. Silverman, Andreas Stein, Edlyn Teske

Des. Codes Cryptogr., 2000

A Note on Shanks's Chains of Primes.

Edlyn Teske, Hugh C. Williams

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

Baby-Step Giant-Step Algorithms for Non-uniform Distributions.

Simon R. Blackburn, Edlyn Teske

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1999

The Pohlig-Hellman Method Generalized for Group Structure Computation.

Edlyn Teske

J. Symb. Comput., 1999

A Problem Concerning a Character Sum.

Edlyn Teske, Hugh C. Williams

Exp. Math., 1999

1998

A space efficient algorithm for group structure computation.

Edlyn Teske

Math. Comput., 1998

A Problem Concerning a Character Sum - Extended Abstract.

Edlyn Teske, Hugh C. Williams

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

Speeding Up Pollard's Rho Method for Computing Discrete Logarithms.

Edlyn Teske

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997

On some computational problems in finite abelian groups.

Johannes Buchmann, Michael J. Jacobson Jr., Edlyn Teske

Math. Comput., 1997