Heuristics on pairing-friendly elliptic curves
Abstract
We present a heuristic asymptotic formula as x ∞ for the number of isogeny classes of pairing-friendly elliptic curves with fixed embedding degree k≥ 3, with fixed discriminant, with rho-value bounded by a fixed 0 such that 1<0<2, and with prime subgroup order at most x.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.