International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Tate-pairing implementations for tripartite key agreement

Authors:
Iwan Duursma
Hyang-Sook Lee
Download:
URL: http://eprint.iacr.org/2003/053
Search ePrint
Search Google
Abstract: We give a closed formula for the Tate-pairing on the hyperelliptic curve $y^2 = x^p - x + d$ in characteristic $p$. This improves recent implementations by Barreto et.al. and by Galbraith et.al. for the special case $p=3$. As an application, we propose a $n$-round key agreement protocol for up to $3^n$ participants by extending Joux's pairing-based protocol to $n$ rounds.
BibTeX
@misc{eprint-2003-11770,
  title={Tate-pairing implementations for tripartite key agreement},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / elliptic curve cryptosystem, Tate-pairing implementation, bilinear Diffie-Hellman problem, group key},
  url={http://eprint.iacr.org/2003/053},
  note={ duursma@math.uiuc.edu 12128 received 16 Mar 2003},
  author={Iwan Duursma and Hyang-Sook Lee},
  year=2003
}