Efficient Explicit Formulae for Genus 3 Hyperelliptic Curve Cryptosystems over Binary Fields
Abstract
The ideal class groups of hyperelliptic curves (HECs) can be used in cryptosystems based on the discrete logarithm problem. Recent developments of computational technologies for scalar multiplications of divisor classes have shown that the performance of hyperelliptic curve cryptosystems (HECC) is compatible to that of elliptic curve cryptosystems. Especially, due to short operand sizes, genus 3 HECC are well suited for all kinds of embedded processor architectures, where resources such as storage, time or power are constrained. In the paper, the acceleration of the divisor class doubling for genus 3 HECs over binary fields is investigated and the number of field operations needed is analysed. By constructing birational transformations of variables, four types of curves which can lead to much faster divisor class doubling are found and the corresponding explicit formulae are given. In particular, for special genus 3 HECs over binary fields with $h(X)=1$, the fastest explicit doubling formula published so far which only requires one field inversion, ten field multiplications and eleven field squarings, is obtained. Furthermore, comparisons with the known results in terms of field operations and implementations of genus 3 HECC over three different binary fields on a Pentium-4 processor are provided.
