103

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 LL of degree 4\geq 4, prescribed integers mm, nn and any prime l1(modmn)l\equiv 1 \pmod{mn}, there exists an ordinary abelian variety over a finite field with endomorphism algebra LL, embedding degree nn with respect to ll and the field extension generated by the ll-torsion points of degree mnmn over the field of definition. We also provide algorithms for the construction of such abelian varieties.

View on arXiv
Comments on this paper