Pairing-based cryptography: Difference between revisions

Revision as of 08:55, 28 July 2022

Revision as of 22:31, 2 September 2022

Line 5:

Let <math>F_q</math> be a [[Finite field]] over prime <math>q</math>, <math>G_1, G_2</math> two additive [[cyclic group]]s 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:

; [[Bilinear map|Bilinearity]]: <math> \forall a,b \in F_q^*,\ \forall P\in G_1, Q\in G_2:\ e\left(aP, bQ\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>.