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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Kohel, D. R., & Smith, B. A. (2006). Efficiently computable endomorphisms for hyperelliptic curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4076 LNCS, pp. 495–509). Springer Verlag. https://doi.org/10.1007/11792086_35
Mendeley helps you to discover research relevant for your work.