https://hal-lirmm.ccsd.cnrs.fr/lirmm-00815484Imbert, LaurentLaurentImbertARITH - Arithmétique informatique - LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - UM - Université de Montpellier - CNRS - Centre National de la Recherche ScientifiqueJacobson, MichaelMichaelJacobsonCPSC - Department of Computer Science [Calgary] - University of CalgaryEmpirical optimization of divisor arithmetic on hyperelliptic curves over $\mathbb{F}_{2m}$HAL CCSD2012[INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR][INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC]Imbert, Laurent2013-04-18 17:13:302022-10-13 08:24:242013-04-30 11:35:08enReportsapplication/pdf1A significant amount of effort has been devoted to improving divisor arithmetic on low-genus hyperelliptic curves via explicit versions of generic algorithms. Moderate and high genus curves also arise in cryptographic applications, for example, via the Weil descent attack on the elliptic curve discrete logarithm problem, but for these curves, the generic algorithms are to date the most efficient available. Nagao~\cite{Nagao2000} described how some of the techniques used in deriving efficient explicit formulas can be used to speed up divisor arithmetic using Cantor's algorithm on curves of arbitrary genus. In this paper, we describe how Nagao's methods, together with a sub-quadratic complexity partial extended Euclidean algorithm using the half-gcd algorithm can be applied to improve arithmetic in the degree zero divisor class group. We present numerical results showing which combination of techniques is more efficient for hyperelliptic curves over $\F_{2^n}$ of various genera.