On the relationship between squared pairings and plain pairings

Bo Gyeong Kang; Je Hong Park

Paper 2005/112

On the relationship between squared pairings and plain pairings

Bo Gyeong Kang and Je Hong Park

Abstract

In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for arbitrary chosen point can be transformed into a plain pairing for the trace zero point which has a special form to compute them more efficiently. This transformation requires only a cost of some Frobenius actions. Additionally, we show that the squared Weil pairing can be computed more efficiently for trace zero point and derive an explicit formula for the 4th powered Weil pairing as an optimized version of the Weil pairing.

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: Weil Tate pairing Squared pairing
Contact author(s): jhpark @ etri re kr
History: 2005-05-13: last of 3 revisions; 2005-04-15: received; See all versions
Short URL: https://ia.cr/2005/112
License: CC BY

BibTeX

@misc{cryptoeprint:2005/112,
      author = {Bo Gyeong Kang and Je Hong Park},
      title = {On the relationship between squared pairings and plain pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/112},
      year = {2005},
      url = {https://eprint.iacr.org/2005/112}
}