Damian Weber

According to our database, Damian Weber authored at least 8 papers between 1995 and 2003.

Collaborative distances:

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

2003

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

1998

Computing Discrete Logarithms with Quadratic Number Rings.

Damian Weber

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

The Solution of McCurley's Discrete Log Challenge.

Damian Weber, Thomas F. Denny

Proceedings of the Advances in Cryptology, 1998

1997

On the computation of discrete logarithms in finite prime fields.

Damian Weber

PhD thesis, 1997

Sieving Methods for Class Group Computation.

Johannes Buchmann, Michael J. Jacobson Jr., Stefan Neis, Patrick Theobald, Damian Weber

Proceedings of the Algorithmic Algebra and Number Theory, 1997

1996

Computing Discrete Logarithms with the General Number Field Sieve.

Damian Weber

Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

Discrete Logarithms: The Effectiveness of the Index Calculus Method.

Oliver Schirokauer, Damian Weber, Thomas F. Denny

Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1995

An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p.

Damian Weber

Proceedings of the Advances in Cryptology, 1995