Title: Selecting Elliptic Curves with Minimal Estimation of Pairing Computation

Year of Publication: Sep - 2015
Page Numbers: 21-29
Authors: Yi-Tang Chang , Yung-Hsiang Liu and Rong-Jaye Chen
Conference Name: The Second International Conference on Information Security and Digital Forensics (ISDF2015)
- Malaysia


In recent years, more and more applications based on bilinear pairing computation have been constructed. The very first issue is to pick up a pairingfriendly elliptic curve, which is efficient and secure. Many schemes have been published to generate secure curves. However, when it comes to implementation, the performance is a major concern. We estimate the cost of computing the reduced Tate pairing on the elliptic curves of shortWeierstrass form with curve parameters, including the field size q, the subgroup order r, and the embedding degree k. From a large amount of curves, we can simply determine the curve on which the pairing computation is much efficient. We also generate some types of curves to perform pairing computation on SageMath and measure the real time cost. The result shows our estimation is accurate.