Heuristics on pairing-friendly elliptic curves

John Boxall

Heuristics on pairing-friendly elliptic curves

Number Theory 2012-04-03 v3

Authors: John Boxall

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$ .

Keywords

isogeny of elliptic curves elliptic curves algebraic curves

Cite

@article{arxiv.1107.0307,
  title  = {Heuristics on pairing-friendly elliptic curves},
  author = {John Boxall},
  journal= {arXiv preprint arXiv:1107.0307},
  year   = {2012}
}

Comments

text substantially rewritten, tables corrected

Related papers

View all related →