Pairing-based cryptography: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Add: s2cid, doi, pages, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | Category:Elliptic curve cryptography | #UCB_Category 11/35
ce
Line 2:
 
==Definition==
The following definition is commonly used in most academic papers.<ref>{{cite journalbook|last1=Koblitz|first1=Neal|last2=Menezes|first2=Alfred|title=Pairing-Based cryptography at high security levels|journalseries=LNCSLecture Notes in Computer Science|date=2005|volume=3796}}</ref>
 
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: