Speeding up the Bilinear Pairings Computation on Curves with Automorphisms

Abstract

Abstract. In this paper we present a new algorithm for computing the bilinear pairings on a family of non-supersingular elliptic curves with non-trivial automorphisms. We obtain a short iteration loop in Miller’s algorithm using non-trivial efficient automorphisms. The proposed algo-rithm is as efficient as the algorithm in [12]