Paper 2012/267
Self-pairings on Hyperelliptic Curves
Steven D. Galbraith and Chang-An Zhao
Abstract
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings are used in some cryptographic schemes and protocols. In this paper, we show how to compute the Tate-Lichtenbaum pairing (D,\phi(D)) on a curve more efficiently than the general case. The speedup is obtained by requiring a simpler final exponentiation. We also discuss how to use this pairing in cryptographic applications.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Tate pairingWeil pairingSelf-pairingPairing based cryptography
- Contact author(s)
- changanzhao @ gmail com
- History
- 2012-05-21: received
- Short URL
- https://ia.cr/2012/267
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/267,
author = {Steven D. Galbraith and Chang-An Zhao},
title = {Self-pairings on Hyperelliptic Curves},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/267},
year = {2012},
url = {https://eprint.iacr.org/2012/267}
}