Tate-pairing implementations for tripartite key agreement

Iwan Duursma; Hyang-Sook Lee

Paper 2003/053

Tate-pairing implementations for tripartite key agreement

Iwan Duursma and Hyang-Sook Lee

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.

Metadata

Available format(s): PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: elliptic curve cryptosystem Tate-pairing implementation bilinear Diffie-Hellman problem group key
Contact author(s): duursma @ math uiuc edu
History: 2003-03-18: received
Short URL: https://ia.cr/2003/053
License: CC BY

BibTeX

@misc{cryptoeprint:2003/053,
      author = {Iwan Duursma and Hyang-Sook Lee},
      title = {Tate-pairing implementations for tripartite key agreement},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/053},
      year = {2003},
      url = {https://eprint.iacr.org/2003/053}
}