논문
Polynomial generating pairing and its criterion for optimal pairing
- 저자Cheol-Min Park, Eunjeong Lee, Hyang-Sook Lee.
- 학술지Applicable Algebra in Engineering, Communication and Computing 25(4), 227-247
- 등재유형
- 게재일자(2014)
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.
