Empirical optimization of divisor arithmetic on hyperelliptic curves over $\mathbb{F}_{2m}$ - Archive ouverte HAL Access content directly
Reports Year : 2012

Empirical optimization of divisor arithmetic on hyperelliptic curves over $\mathbb{F}_{2m}$

(1) , (2)
1
2

Abstract

A 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.
Fichier principal
Vignette du fichier
improved_nucomp.pdf (453.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00815484 , version 1 (18-04-2013)

Identifiers

  • HAL Id : lirmm-00815484 , version 1

Cite

Laurent Imbert, Michael Jacobson. Empirical optimization of divisor arithmetic on hyperelliptic curves over $\mathbb{F}_{2m}$. RR-13008, 2012, pp.18. ⟨lirmm-00815484⟩
112 View
297 Download

Share

Gmail Facebook Twitter LinkedIn More