CryptoDB
Efficient Computation of the Tate Pairing on Hyperelliptic Curves for Cryptosystems
Authors: | |
---|---|
Download: | |
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$. |
BibTeX
@misc{eprint-2005-12503, title={Efficient Computation of the Tate Pairing on Hyperelliptic Curves for Cryptosystems}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / Tate pairing computation, hyperelliptic curve, identity-based encryption, implementation}, url={http://eprint.iacr.org/2005/167}, note={ ejlee@kias.re.kr 12944 received 1 Jun 2005, withdrawn 9 Jun 2005}, author={YoungJu Choie and Jaemyung Kim and Eunjeong Lee}, year=2005 }