An Implementation and Evaluation of Pairing Library ELiPS for BLS Curve with Several Techniques

Abstract

In recent years, pairing encryption is receiving a lot of attention since it enables many innovative and multi-functional cryptographic applications based on pairing e.g. searchable encryption, broadcast encryption and so on. Pairing is a map from two additive rational point groups $\\mathbb{G}_{1}, \\mathrm{G}_{2}$ to a multiplicative group $\\mathbb{G}_{3}$, however, it requires complexity computation. Therefore, the author tries to develop a 128-bit security level pairing library ELiPS (Efficient Library for Pairing Systems) that incorporates various high-speed methods using BLS curves. As a result, scalar multiplications on $\\mathbb{G}_{1}$ and $\\mathbb{G}_{2}$, exponentiation on $\\mathbb{G}_{3}$, and optimal-ate pairing can be computed in 0.42[ms], 0.79[ms], 1.13[ms], and 3.12[ms], respectively.