Skip to Main content Skip to Navigation
New interface
Conference papers

Speeding up the discrete log computation on curves with automorphisms

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 on the hyperelliptic curves described in the literature.
Document type :
Conference papers
Complete list of metadata

Cited literature [51 references]  Display  Hide  Download

https://hal.inria.fr/inria-00511639
Contributor : Pierrick Gaudry Connect in order to contact the contributor
Submitted on : Wednesday, August 25, 2010 - 3:35:17 PM
Last modification on : Wednesday, October 20, 2021 - 1:31:01 AM
Long-term archiving on: : Friday, November 26, 2010 - 2:41:04 AM

File

automorphisms.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00511639, version 1

Collections

Citation

Iwan Duursma, Pierrick Gaudry, François Morain. Speeding up the discrete log computation on curves with automorphisms. Asiacrypt, 1999, Singapour, Singapore. pp.103-121. ⟨inria-00511639⟩

Share

Metrics

Record views

181

Files downloads

472