Name
Abstract | ||
|---|---|---|
We show how to speed up the discrete log computations on curves having automorphisms of large order, thus generalizing the
attacks on anomalous binary elliptic curves. This includes the first known attack on most of the hyperelliptic curves described
in the literature.
|
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/978-3-540-48000-6_10 | ASIACRYPT |
Keywords | Field | DocType |
discrete log computation,elliptic and hyperelliptic curves,auto- morphisms.,discrete logarithm,elliptic curve,hyperelliptic curve | Discrete mathematics,Family of curves,Automorphism,Pollard's rho algorithm for logarithms,Pollard's kangaroo algorithm,Number theory,Elliptic curve,Mathematics,Binary number,Discrete logarithm | Conference |
Volume | ISSN | ISBN |
1716 | 0302-9743 | 3-540-66666-4 |
Citations | PageRank | References |
42 | 2.34 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Iwan M. Duursma | 1 | 279 | 26.85 |
| Pierrick Gaudry | 2 | 983 | 71.39 |
| François Morain | 3 | 321 | 48.42 |