Faster Ate Pairing Computation over Pairing-Friendly Elliptic Curves Using GLV Decomposition
- 주제(키워드) Pairing computation , ate pairing , GLV decomposition , elliptic curves
- 관리정보기술 faculty
- 발행기관 ELECTRONICS TELECOMMUNICATIONS RESEARCH INST
- 발행년도 2013
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000086845
- 본문언어 영어
- Published As http://dx.doi.org/10.4218/etrij.13.0112.0756
초록/요약
The preexisting pairings ate, ate,, R-ate, and optimal-ate use q-expansion, where q is the size of the defining field for the elliptic curves. Elliptic curves with small embedding degrees only allow a few of these pairings. In such cases, efficiently computable endomorphisms can be used, as in [11] and [12]. They used the endomorphisms that have characteristic polynomials with very small coefficients, which led to some restrictions in finding various pairing-friendly curves. To construct more pairing-friendly curves, we consider,mu-expansion using the Gallant-Lambert-Vanstone (GLV) decomposition method, where p is an arbitrary integer. We illustrate some pairing-friendly curves that provide more efficient pairing from the mu-expansion than from the ate pairing. The proposed method can achieve timing results at least 20% faster than the ate pairing.
more