On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields

摘要

Let A be an abelian variety denned over a non-prime finite field F_q that has embedding degree k with respect to a subgroup of prime order r. In this paper we give explicit conditions on q, k, and r that imply that the minimal embedding field of A with respect to r is F_(q~k). When these conditions hold, the embedding degree k is a good measure of the security level of a pairing-based cryptosystem that uses A.rnWe apply our theorem to supersingular elliptic curves and to super-singular genus 2 curves, in each case computing a maximum ρ-value for which the minimal embedding field must be F_(q~k). Our results are in most cases stronger (i.e., give larger allowable ρ-values) than previously known results for supersingular varieties, and our theorem holds for general abelian varieties, not only supersingular ones.