Polynomial generating pairing and its criterion for optimal pairing

Eunjeong Lee, Hyang Sook Lee, Cheol Min Park

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)227-247
Number of pages21
JournalApplicable Algebra in Engineering, Communications and Computing
Issue number4
StatePublished - 18 Aug 2014


  • Optimal pairing
  • Pairing-friendly elliptic curve
  • Polynomial generating pairing


Dive into the research topics of 'Polynomial generating pairing and its criterion for optimal pairing'. Together they form a unique fingerprint.

Cite this