Speeding up the discrete log computation on curves with automorphisms

I. Duursma, P. Gaudry, F. Morain

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
EditorsKwok Yan Lam, Eiji Okamoto, Chaoping Xing
PublisherSpringer
Pages103-121
Number of pages19
ISBN (Print)3540666664, 9783540666660
DOIs
StatePublished - 1999
Externally publishedYes
Event5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999 - Singapore, Singapore
Duration: Nov 14 1999Nov 18 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1716
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999
Country/TerritorySingapore
CitySingapore
Period11/14/9911/18/99

Keywords

  • Automorphisms
  • Discrete logarithm
  • Elliptic and hyperelliptic curves

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Speeding up the discrete log computation on curves with automorphisms'. Together they form a unique fingerprint.

Cite this