Speeding up the discrete log computation on curves with automorphisms

I. Duursma; P. Gaudry; F. Morain

doi:10.1007/978-3-540-48000-6_10

Speeding up the discrete log computation on curves with automorphisms

I. Duursma
, P. Gaudry
, F. Morain

Limoges University
Laboratoire d'Informatique (LIX)

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

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.

langue originale	Anglais
titre	Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
rédacteurs en chef	Kwok Yan Lam, Eiji Okamoto, Chaoping Xing
Editeur	Springer Verlag
Pages	103-121
Nombre de pages	19
ISBN (imprimé)	3540666664, 9783540666660
Les DOIs	https://doi.org/10.1007/978-3-540-48000-6_10
état	Publié - 1 janv. 1999
Evénement	5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999 - Singapore, Singapour Durée: 14 nov. 1999 → 18 nov. 1999

Série de publications

Nom	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1716
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Une conférence

Une conférence	5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999
Pays/Territoire	Singapour
La ville	Singapore
période	14/11/99 → 18/11/99

Accès au document

10.1007/978-3-540-48000-6_10

Contient cette citation

Duursma, I., Gaudry, P., & Morain, F. (1999). Speeding up the discrete log computation on curves with automorphisms. Dans K. Y. Lam, E. Okamoto, & C. Xing (eds.), Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (p. 103-121). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 1716). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_10

Duursma, I. ; Gaudry, P. ; Morain, F. / Speeding up the discrete log computation on curves with automorphisms. Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Editeur / Kwok Yan Lam ; Eiji Okamoto ; Chaoping Xing. Springer Verlag, 1999. p. 103-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e6c2eca7a1024867bc7977596f70a110,

title = "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 of the hyperelliptic curves described in the literature.",

keywords = "Automorphisms, Discrete logarithm, Elliptic and hyperelliptic curves",

author = "I. Duursma and P. Gaudry and F. Morain",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999 ; Conference date: 14-11-1999 Through 18-11-1999",

year = "1999",

month = jan,

day = "1",

doi = "10.1007/978-3-540-48000-6\_10",

language = "English",

isbn = "3540666664",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "103--121",

editor = "Lam, \{Kwok Yan\} and Eiji Okamoto and Chaoping Xing",

booktitle = "Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings",

}

Duursma, I, Gaudry, P & Morain, F 1999, Speeding up the discrete log computation on curves with automorphisms. Dans KY Lam, E Okamoto & C Xing (eds), Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOL. 1716, Springer Verlag, p. 103-121, 5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999, Singapore, Singapour, 14/11/99. https://doi.org/10.1007/978-3-540-48000-6_10

Speeding up the discrete log computation on curves with automorphisms. / Duursma, I.; Gaudry, P.; Morain, F.
Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Ed. / Kwok Yan Lam; Eiji Okamoto; Chaoping Xing. Springer Verlag, 1999. p. 103-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 1716).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - Speeding up the discrete log computation on curves with automorphisms

AU - Duursma, I.

AU - Gaudry, P.

AU - Morain, F.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

KW - Automorphisms

KW - Discrete logarithm

KW - Elliptic and hyperelliptic curves

U2 - 10.1007/978-3-540-48000-6_10

DO - 10.1007/978-3-540-48000-6_10

M3 - Conference contribution

AN - SCOPUS:84956867482

SN - 3540666664

SN - 9783540666660

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 103

EP - 121

BT - Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings

A2 - Lam, Kwok Yan

A2 - Okamoto, Eiji

A2 - Xing, Chaoping

PB - Springer Verlag

T2 - 5th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1999

Y2 - 14 November 1999 through 18 November 1999

ER -

Duursma I, Gaudry P, Morain F. Speeding up the discrete log computation on curves with automorphisms. Dans Lam KY, Okamoto E, Xing C, rédacteurs en chef, Advances in Cryptology - ASIACRYPT 1999 - International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Springer Verlag. 1999. p. 103-121. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-48000-6_10

Speeding up the discrete log computation on curves with automorphisms

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation