Computing fixed argument pairings with the elliptic net algorithm

Abstract

The pairing-based cryptosystem was proposed in 2001, and it provides efficient implementations of identity-based encryption (IBE) and attribute-based encryption (ABE). In 2010, Costello and Stebila introduced the concept of fixed argument pairing, which can be applied to many applications of pairings, and, to compute these pairings, they proposed an efficient algorithm based on the Miller algorithm. In this paper, we propose a method for computing fixed argument pairings, based on the elliptic net method proposed by Stange.