Pairing-based cryptography: Difference between revisions

Revision as of 18:04, 1 February 2019

Revision as of 12:48, 19 March 2019

Line 5:

Let <math>G_1, G_2</math> be two additive cyclic groups of prime order <math>q</math>, and <math>G_T</math> another cyclic group of order <math>q</math> written multiplicatively. A pairing is a map: <math> e: G_1 \times G_2 \rightarrow G_T </math>, which satisfies the following properties:

; [[Bilinearity]]: <math> \forall a,b \in F_q^*,\ \forall P\in G_1, Q\in G_2:\ e\left(P^a P, Q^b Q\right) = e\left(P, Q\right)^{ab}</math>

; [[Degeneracy (mathematics)|Non-degeneracy]]: <math>e \neq 1</math>

; Computability: There exists an efficient algorithm to compute <math>e</math>.