Computable. There exists an efficient algorithm to compute e(P, Q) for all P, Q ∈ G1. From the literature [1], we note that such a bilinear pairing may be realized using the modified Weil pairing associated with supersingular elliptic curves.
Appears in 2 contracts
Sources: Two Party Authenticated Key Agreement Protocol, Authenticated Key Agreement Protocol