Computable. Given P, Q ∈ G1, there exists an efficient algorithm to compute e(P, Q).
Appears in 1 contract
Sources: Block Design Based Key Agreement for Group Data Sharing
Computable. Given P, Q ∈ G1, there There exists an efficient efficient algorithm to compute e(P, Q)) for all P, Q ∈ G1.
Appears in 1 contract
Sources: Id Based Group Key Agreement