# Edlyn Teske

According to our database

Collaborative distances:

^{1}, Edlyn Teske authored at least 33 papers between 1997 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2013

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

IACR Cryptology ePrint Archive, 2013

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

Proceedings of the Number Theory and Cryptography, 2013

2011

Pairing-Friendly Elliptic Curves.

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

2010

A Taxonomy of Pairing-Friendly Elliptic Curves.

J. Cryptology, 2010

2009

Pairings on hyperelliptic curves

CoRR, 2009

2008

On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6.

Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007

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

IACR Cryptology ePrint Archive, 2007

2006

An Elliptic Curve Trapdoor System.

J. Cryptology, 2006

A taxonomy of pairing-friendly elliptic curves.

IACR Cryptology ePrint Archive, 2006

Cryptographic implications of Hess' generalized GHS attack.

Appl. Algebra Eng. Commun. Comput., 2006

2005

Point counting on Picard curves in large characteristic.

Math. Comput., 2005

2004

Cryptographic Implications of Hess' Generalized GHS Attack.

IACR Cryptology ePrint Archive, 2004

Weak Fields for ECC.

Proceedings of the Topics in Cryptology, 2004

2003

An Elliptic Curve Trapdoor System.

IACR Cryptology ePrint Archive, 2003

Weak Fields for ECC.

IACR Cryptology ePrint Archive, 2003

Computing discrete logarithms with the parallelized kangaroo method, .

Discrete Applied Mathematics, 2003

2002

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

Math. Comput., 2002

The parallelized Pollard kangaroo method in real quadratic function fields.

Math. Comput., 2002

On some Attacks on Multi-prime RSA.

IACR Cryptology ePrint Archive, 2002

On Some Attacks on Multi-prime RSA.

Proceedings of the Selected Areas in Cryptography, 2002

Factoring N = pq with the Elliptic Curve Method.

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

2001

On random walks for Pollard's rho method.

Math. Comput., 2001

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

IACR Cryptology ePrint Archive, 2001

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

Proceedings of the Progress in Cryptology, 2001

2000

Analysis of the Xedni Calculus Attack.

Des. Codes Cryptogr., 2000

A Note on Shanks's Chains of Primes.

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

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

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

1999

The Pohlig-Hellman Method Generalized for Group Structure Computation.

J. Symb. Comput., 1999

A Problem Concerning a Character Sum.

Experimental Mathematics, 1999

1998

A space efficient algorithm for group structure computation.

Math. Comput., 1998

A Problem Concerning a Character Sum - Extended Abstract.

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

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

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

1997

On some computational problems in finite abelian groups.

Math. Comput., 1997