chapter  6
Scalar Multiplication and Exponentiation in Pairing Groups Joppe Bos, Craig Costello, and Michael Naehrig
Pages 24

Algorithms to compute cryptographic pairings involve computations on elements in all three pairing groups, G1, G2, and GT . However, protocols often compute only a single pairing operation but need to compute many operations in any or all of the groups G1, G2, and GT [14, 31, 52]. In this chapter, we discuss ways to enhance the performance of group operations that are not the pairing computation.