Computable. For e(g, p) . g , p ∈ G1 , there exists an efficient algorithm to compute Typically, the map e will be derived from either the Weil or ▇▇▇▇ pairing on an elliptic curve over a finite field. Pairings and other parameters should be selected in proactive for efficiency and security.
Appears in 1 contract
Sources: Chameleon Based Deniable Authenticated Key Agreement Protocol
Computable. For e(g, p) . g , p ∈ G1 , there exists is an efficient algorithm to compute e(g, p) . Typically, the map e will be derived from either the Weil or ▇▇▇▇ pairing on an elliptic curve over a finite field. Pairings and other parameters should be selected in proactive for efficiency and security.
Appears in 1 contract
Sources: Key Agreement Protocol