Performance evaluation of efficient algorithms for Tate pairing

The properties of the Tate pairing are applied to various cryptographic systems. The problem is that the Tate pairing computation is expensive operation, and various methods for faster computation have been proposed. However their actual methods are not so clear. In this paper, we combined their methods and our technique for implementation to apply the program of computing Tate pairing. We evaluated the performance and compared the contribution of each method. There is a case, which yields slower computation caused by overheads of implementation. Consequently we obtained the result of 70% reduction of calculation of Tate pairing in total and showed that Tate pairing has practical applicability.