In this paper, we present a novel method for constructing a
super-optimal pairing with great efficiency, which we call the omega
pairing. The computation of the omega pairing requires the simple
final exponentiation and short loop length in Miller's algorithm
which leads to a significant improvement over the previously known
techniques on certain pairing-friendly curves. Experimental results
show that the omega pairing is about 22% faster and 19% faster
than the super-optimal pairing proposed by Scott at security level
of AES 80 bits on certain pairing-friendly curves in affine
coordinate systems and projective coordinate systems, respectively.
↧