Self-pairings on Hyperelliptic Curves

Steven D.  Galbraith; Chang-An Zhao

Paper 2012/267 Original: eprint.iacr.org/2012/267 ↗

Self-pairings on Hyperelliptic Curves

Steven D. Galbraith

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: Preprint.
History: 2012-05-21: last updated; 2012-05-21: published
Short URL: https://ia.cr/2012/267
License: https://creativecommons.org/licenses/by/4.0/

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}
}