On finite fields for pairing based cryptography
Florian Luca, Igor E. Shparlinski · Advances in Mathematics of Communications · 2007
Here, we improve our previous bound on the number of finite fields over which elliptic curves of cryptographic interest with a given embedding degree and small complex multiplication discriminant may exist. We also give some heuristic arguments which lead to a lower bound which in some cases is close to our upper bound.