Cryptology ePrint Archive: Report 2004/255
A Complete Divisor Class Halving Algorithm for Hyperelliptic Curve Cryptosystems of Genus Two
Izuru Kitamura and Masanobu Katagi and Tsuyoshi Takagi
Abstract: We deal with a divisor class halving algorithm on hyperelliptic curve cryptosystems (HECC), which can be used for scalar multiplication, instead of a doubling algorithm. It is not obvious how to construct a halving algorithm, due to the complicated addition formula of hyperelliptic curves. In this paper, we propose the first halving algorithm used for HECC of genus 2, which is as efficient as the previously known doubling algorithm. From the explicit formula of the doubling algorithm, we can generate some equations whose common solutions contain the halved value. From these equations we derive four specific equations and show an algorithm that selects the proper halved value using two trace computations in the worst case. If a base point is fixed, we can reduce these extra field operations by using a pre-computed table which shows the correct halving divisor class —the improvement over the previously known fastest doubling algorithm is up to about 10%. This halving algorithm is applicable to DSA and DH scheme based on HECC. Finally, we present the divisor class halving algorithms for not only the most frequent case but also other exceptional cases.
Category / Keywords: hyperelliptic curve cryptosystems, scalar multiplication, point halving, efficient computation
Publication Info: This is a full version of ACISP 2005 paper.
Date: received 3 Oct 2004, last revised 3 Jul 2005
Contact author: Izuru Kitamura at jp sony com
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Note: The old title of this paper was "A Point Halving Algorithm for Hyperellptic Curves".
Version: 20050704:050346 (All versions of this report)
Short URL: ia.cr/2004/255
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]