International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Tate pairing computation on the divisors of hyperelliptic curves for cryptosystems

Authors:
Eunjeong Lee
Yoonjin Lee
Download:
URL: http://eprint.iacr.org/2005/166
Search ePrint
Search Google
Abstract: In recent papers \cite{Bar05} and \cite{CKL}, Barreto et al and Choie et al worked on hyperelliptic curves $H_b$ defined by $y^2+y = x^5 + x^3 + b$ over a finite field $\Ftn$ with $b=0$ or $1$ for a secure and efficient pairing-based cryptosystems. We find a completely general method for computing the Tate-pairing over divisor class groups of the curves $H_b$ in a very explicit way. In fact, the Tate-pairing is defined over the entire divisor class group of a curve, not only over the points on a curve. So far only pointwise approach has been made in ~\cite{Bar05} and ~\cite{CKL} for the Tate-pairing computation on the hyperelliptic curves $H_b$ over $\Ftn$. Furthermore, we obtain a very efficient algorithm for the Tate pairing computation over divisors by reducing the cost of computing. We also find a crucial condition for divisor class group of hyperelliptic curve to have a significant reduction of the loop cost in the Tate pairing computation.
BibTeX
@misc{eprint-2005-12502,
  title={Tate pairing computation on the divisors of hyperelliptic curves for cryptosystems},
  booktitle={IACR Eprint archive},
  keywords={Tate pairing computation, hyperelliptic curve cryptosystems, pairing-based cryptosystems},
  url={http://eprint.iacr.org/2005/166},
  note={ ejlee@kias.re.kr 13017 received 1 Jun 2005, last revised 22 Aug 2005},
  author={Eunjeong Lee and Yoonjin Lee},
  year=2005
}