Heuristics on pairing-friendly elliptic curves - Normandie Université Access content directly
Journal Articles Journal of Mathematical Cryptology Year : 2012

Heuristics on pairing-friendly elliptic curves

John Boxall
  • Function : Author
  • PersonId : 961487


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.
Fichier principal
Vignette du fichier
PUBLISHED.pdf (308.95 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-02153424 , version 1 (12-06-2019)



John Boxall. Heuristics on pairing-friendly elliptic curves. Journal of Mathematical Cryptology, 2012, 6 (2), pp.14 - 52. ⟨10.1515/jmc-2011-0004⟩. ⟨hal-02153424⟩
8 View
59 Download



Gmail Facebook X LinkedIn More