Speeding up the bilinear pairings computation on curves with automorphisms
In this paper we present an 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 algorithm is as
efficient as Scott's algorithm in [12].
supersingular elliptic curves with non-trivial automorphisms. We obtain a short iteration loop
in Miller's algorithm using non-trivial efficient automorphisms. The proposed algorithm is as
efficient as Scott's algorithm in [12].
Abstract
In this paper we present an 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 algorithm is as efficient as Scott's algorithm in [12].
eprint.iacr.org
Showing the best result for this search. See all results