Efficiently Computable Endomorphisms for Hyperelliptic Curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Efficiently Computable Endomorphisms for Hyperelliptic Curves


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.

Dates and versions

inria-00537882 , version 1 (19-11-2010)



David Kohel, Benjamin Smith. Efficiently Computable Endomorphisms for Hyperelliptic Curves. Algorithmic Number Theory Symposium: ANTS-VII, Jul 2006, Berlin, Germany. pp.495-509, ⟨10.1007/11792086_35⟩. ⟨inria-00537882⟩


140 View
0 Download



Gmail Facebook X LinkedIn More