본문 바로가기 메뉴바로가기

Papers

Polynomial generating pairing and its criterion for optimal pairing

  • Research Fields수리모델연구부
  • AuthorCheol-Min Park, Eunjeong Lee, Hyang-Sook Lee.
  • JournalApplicable Algebra in Engineering, Communication and Computing 25(4), 227-247 (2014
  • Classification of papersSCI
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.
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.