Heuristics on pairing-friendly elliptic curves
classification
🧮 math.NT
keywords
fixedcurvesellipticpairing-friendlyasymptoticboundedclassesdegree
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.