arXiv · 1107.0307
Heuristics on pairing-friendly elliptic curves
Abstract
We present a heuristic asymptotic formula as $x\to \infty$ for the number of isogeny classes of pairing-friendly elliptic curves with fixed embedding degree $k\geq 3$, with fixed discriminant, with rho-value bounded by a fixed $\rho_0$ such that $1<\rho_0<2$, and with prime subgroup order at most $x$.
Explore related subjects
Keep this discovery
John Boxall. 2011-07-01. Heuristics on pairing-friendly elliptic curves. https://arxiv.org/abs/1107.0307
Cite the original work for its findings. Save a collection to share your selection of sources.