Abstract
Miyaji, Nakabayashi and Takano have recently suggested a construction of the so-called MNT elliptic curves with low embedding degree, which are also of importance for pairing-based cryptography. We give some heuristic arguments which suggest that there are only about z1/2+ o(1) of MNT curves with complex multiplication discriminant up to z. We also show that there are very few finite fields over which elliptic curves with small embedding degree and small complex multiplication discriminant may exist (regardless of the way they are constructed). © International Association for Cryptologic Research 2006.
Author supplied keywords
Cite
CITATION STYLE
Luca, F., & Shparlinski, I. E. (2006). Elliptic curves with low embedding degree. Journal of Cryptology, 19(4), 553–562. https://doi.org/10.1007/s00145-006-0544-0
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.