| |
| 2003 | ||
|---|---|---|
| 7 | EE | Detlef Hühnlein, Michael J. Jacobson Jr., Damian Weber: Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders. Des. Codes Cryptography 30(3): 281-299 (2003) |
| 2000 | ||
| 6 | EE | Detlef Hühnlein, Michael J. Jacobson Jr., Damian Weber: Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders. Selected Areas in Cryptography 2000: 275-287 |
| 1998 | ||
| 5 | EE | Damian Weber, Thomas F. Denny: The Solution of McCurley's Discrete Log Challenge. CRYPTO 1998: 458-471 |
| 4 | EE | Damian Weber: Computing Discrete Logarithms with Quadratic Number Rings. EUROCRYPT 1998: 171-183 |
| 1996 | ||
| 3 | Oliver Schirokauer, Damian Weber, Thomas F. Denny: Discrete Logarithms: The Effectiveness of the Index Calculus Method. ANTS 1996: 337-361 | |
| 2 | Damian Weber: Computing Discrete Logarithms with the General Number Field Sieve. ANTS 1996: 391-403 | |
| 1995 | ||
| 1 | EE | Damian Weber: An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p. EUROCRYPT 1995: 95-105 |
| 1 | Thomas F. Denny | [3] [5] |
| 2 | Detlef Hühnlein | [6] [7] |
| 3 | Michael J. Jacobson Jr. | [6] [7] |
| 4 | Oliver Schirokauer | [3] |