Efficiently computable endomorphisms for hyperelliptic curves

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic Jacobians, but one obstruction is the lack of explicit models of curves together with an efficiently computable endomorphism. In the case of hyperelliptic curves there are limited examples, most methods focusing on special CM curves or curves defined over a small field. In this article we describe three infinite families of curves which admit an efficiently computable endomorphism, and give algorithms for their efficient application.
15 pages, LaTeX with xy-pic and algorithmicx packages. To appear in the proceedings of the 7th Algorithmic Number Theory Symposium (ANTS-VII), Berlin, July 2006

Keywords

Number Theory, Algebraic Geometry, 11Y16; 11G; 14Q05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/110276

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0603505
 http://arxiv.org/abs/math/0603505

Collections

arXiv