High security pairing-based cryptography revisitedRobert Granger, Dan Page, Nigel Smart, High security pairing-based cryptography revisited. Algorithmic Number Theory Symposium VII, pp. 480–494. July 2006. No electronic version available.
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We re-examine how one should implement pairings over ordinary elliptic curves for various practical levels of security. We conclude, contrary to prior work, that the Tate pairing is more efficient than the Weil pairing for all such security levels. This is achieved by using efficient exponentiation techniques in the cyclotomic subgroup backed by efficient squaring routines within the same subgroup