Here, we improve our previous bound on the number of finite fields over which elliptical curves of cryptographic interest with a given embedding degree and small complex multiplication discrimination may excist. We also give some heuristic arguements which lead to a lower bound which in some cases is close to our upper bound.
|Number of pages||6|
|Journal||Advances in Mathematics of Communications|
|Publication status||Published - Aug 2007|
- elliptical curves
- pairing based cryptography
- embedding degree