| On Finite fields for pairing based cryptography (2007) | |||||||||||||||
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.. 6 page(s) | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||