On the relationship between squared pairings and plain pairings, http://eprint.iacr.org/2005/112
| Citations: | 5 - 0 self |
BibTeX
@MISC{Kang_onthe,
author = {Bo Gyeong Kang and Je Hong Park},
title = {On the relationship between squared pairings and plain pairings, http://eprint.iacr.org/2005/112},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. Keywords: Weil/Tate pairing, Squared pairing, Pairing-based cryptosystems 1
Citations
| 247 | Efficient algorithms for pairing-based cryptosystems - Barreto, Kim, et al. |
| 111 | Efficient pairing computation on supersingular Abelian varieties - Barreto, Galbraith, et al. - 2007 |
| 43 | On the Selection of Pairing-Friendly Groups - Barreto, Lynn, et al. - 2004 |
