Sciweavers

ANTS
2008
Springer

On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6

14 years 28 days ago
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We give an explicit algorithm to generate such curves. We derive a heuristic lower bound for the number E(z) of MNT curves with k = 6 and discriminant D z, and compare this lower bound with experimental data.
Koray Karabina, Edlyn Teske
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where ANTS
Authors Koray Karabina, Edlyn Teske
Comments (0)