Efficient Pairing Computation Based on Comb Method

It is well known that the Weil and Tate pairing are very time consuming computation, hence it is necessary to develop more efficient implementations of the Weil and Tate pairing for the practical application of pairing based cryptosystems proposed recently. This paper presented a new modified Miller´s algorithm for computing Weil and Tate pairing based on the comb method. Comparisons with Miller algorithm as well as other algorithms are given. Results show that the new proposed algorithm is more efficient than other algorithms.