Skip to main content
Conference ProceedingsOPEN ACCESS

Speeding up the discrete log computation on curves with automorphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1716 103-121
DOI: 10.1007/978-3-540-48000-6_10
59Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Duursma, I., Gaudry, P., & Morain, F. (1999). Speeding up the discrete log computation on curves with automorphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 103–121). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free