More constructing pairing-friendly elliptic curves for cryptography(Application, Algorithmic Number Theory and Its Applications, <Special Issue> Joint Symposium of JSIAM Activity Groups 2007)

Abstract

The problem of constructing elliptic curves suitable for pairing applications has received a lot of attention. To solve this problem, we propose a variant of the Brezing and Weng method. And we produce new families of parameters for pairing-friendly elliptic curves.