Constructing Pairing-friendly Elliptic Curves with Small rho

Abstract

In this paper, we provide a method of constructing pairing-friendly elliptic curves on which the optimal pairing can be defined and the resulting curves have small ¦Ñ value approximate to 1. Our algorithm is explicit and works for arbitrary embedding degree k and large prime subgroup order r.