International Association
for Cryptologic Research

In this paper we propose a modified Elliptic Net algorithm to compute pairings. By reducing the number of the intermediate variables which should be updated in the iteration loop of the Elliptic Net algorithm, we speed up the computation of pairings. Experimental results show that the proposed method is about $14\\%$ faster than the original Elliptic Net algorithm on certain supersingular elliptic curves with embedding degree $two$.