Heuristics on pairing-friendly elliptic curves
Abstract
We present a heuristic asymptotic formula as x tends to infinity for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree k 3, with fixed discriminant, with rho-value bounded by a fixed rho0 such that 1 < rho0 < 2, and with prime subgroup order at most x.
Domains
Number Theory [math.NT]
Origin : Publisher files allowed on an open archive
Loading...