We define a polynomial generating pairing (PGP) and propose a method to construct a family of pairing friendly curves from PGP. We show that a bilinear map over the family is directly determined by the coefficients of the PGP and the map is non-degenerate under a minor condition which is satisfied with cryptographic parameters. Finally, we provide a criterion for PGP to obtain an optimal pairing.
|Number of pages||21|
|Journal||Applicable Algebra in Engineering, Communications and Computing|
|State||Published - 18 Aug 2014|
- Optimal pairing
- Pairing-friendly elliptic curve
- Polynomial generating pairing