On the relationship between squared pairings and plain pairings
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 an arbitrary chosen point can be transformed into the plain pairing for a trace zero point which has a special form to compute them more efficiently. Then the optimizations made for computing squared pairings are combined with the computation of pairings on these trace zero points, to achieve even better performance for the computation of the 4th powered Weil pairing. (c) 2005 Elsevier B.V. All rights reserved.
squared pairing weil/tate pairing pairing computation pairing-based cryptosystems cryptography