Abelian varieties in pairing-based cryptography
Abstract
We study the problem of the embedding degree of an abelian variety over a finite field which is vital in pairing-based cryptography. In particular, we show that for a prescribed CM field of degree , prescribed integers , and any prime , there exists an ordinary abelian variety over a finite field with endomorphism algebra , embedding degree with respect to and the field extension generated by the -torsion points of degree over the field of definition. We also provide algorithms for the construction of such abelian varieties.
View on arXivComments on this paper
