Efficient Computation of the Weil Pairing in ID-based Cryptosystems

Abstract

Although identity-based (ID-based) cryptography has a number of advantages over conventional public key methods; the computational cost is significantly greater. The dominant part of this cost is the Weil pairing. In this paper, we propose an efficient algorithm for computing the Weil pairing using point halving.