An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p. - Damian Weber (EUROCRYPT, 1995)

Discrete Logarithms: The Effectiveness of the Index Calculus Method. - Oliver Schirokauer; Damian Weber; Thomas F. Denny (ANTS, 1996)

Computing Discrete Logarithms with the General Number Field Sieve. - Damian Weber (ANTS, 1996)

Sieving Methods for Class Group Computation. - Johannes Buchmann 001; Michael J. Jacobson Jr.; Stefan Neis; Patrick Theobald; Damian Weber (Algorithmic Algebra and Number Theory, 1997)

On the computation of discrete logarithms in finite prime fields. - Damian Weber (1997)

The Solution of McCurley's Discrete Log Challenge. - Damian Weber; Thomas F. Denny (CRYPTO, 1998)

Computing Discrete Logarithms with Quadratic Number Rings. - Damian Weber (EUROCRYPT, 1998)

Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders. - Detlef Hühnlein; Michael J. Jacobson Jr.; Damian Weber (Des. Codes Cryptogr., 2003)