Divisor Class Halving Algorithms for Genus Three Hyperelliptic Curves

In an (hyper)elliptic curve cryptosystem, the most important operation or the most time-consuming operation is the divisor scalar multiplication which consists of a sequence of doubling (of divisor) and addition (of two divisors). Point halving algorithms for elliptic curve cryptosystem and divisor halving algorithms for genus-2 hyperelliptic curve cryptosystem had been successively put forward to take the place of doubling algorithms for speeding up (hyper)elliptic curve cryptosystem. We present an outline for an algorithm for divisor halving on genus-3 hyperelliptic curves over the binary field and give some explicit formulae for a class of genus-3 curves. Our algorithm improves previously known best doubling algorithms in most cases. A halve-and-add binary method for divisor scalar multiplications is presented.