Abstract
There are various protocols using pairing operations such as ID- Based Encryption and Functional Encryption in recent years. These protocols could not be realized by using conventional public key encryption. Hence, pairing plays an important role in modern society. However, implementing an efficient pairing library needs a deep knowledge of mathematics and is a not- trivial task. In order to solve this problem, we released Pairing Library called TEPLA (University of Tsukuba Elliptic Curve and Pairing Library). This library can compute pairings, finite field arithmetic and elliptic curve operations. TEPLA is implemented by using Beuchat et al.'s algorithm in PAIRING2010. After a year Aranha et al.\ proposed a new method of compute pairings. The method of Arahna et al.\ computes a pairing faster than Beuchat et al.'s algorithm by about 28\%-34\%. In this work, we actually implement a pairing library with reference by using Aranha et al.'s algorithm in EUROCRYPT2011 to demonstrate the speed of Aranha el al.\ and offer the pairing library as an open source software.