Florian Luca - Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 58089, Morelia, Michoacán, Mexico (email)
Abstract: 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.
Keywords: Elliptic curves, pairing based cryptography,
Received: July 2006; Revised: June 2007; Published: July 2007.
2014 Impact Factor.476