Paper 2005/167

Efficient Computation of the Tate Pairing on Hyperelliptic Curves for Cryptosystems

YoungJu Choie, Jaemyung Kim, and Eunjeong Lee

Abstract

In this paper, we suggest to use the curve $\curve, b=0 \mbox{ or } 1$ over $\Ftn$ for a secure and efficient pairing-based cryptosystems. For this curve, we develop efficient algorithms to compute the Tate pairing and give an implementation result of Tate paring on the curve $H_0$.

Note: We have to revise this paper, but it is not ready to submit the revised version. We would like to withdraw 2005/167 at this moment.