Heuristics on pairing-friendly abelian varieties
John Boxall, David Gruenewald
TL;DR
This paper develops heuristic asymptotic formulas to estimate the quantity of pairing-friendly abelian varieties over prime fields, extending earlier research in the area.
Contribution
It introduces generalized heuristic formulas for counting pairing-friendly abelian varieties, broadening the scope of previous specific cases.
Findings
Heuristic formulas match empirical data well.
Extension of previous work to more general settings.
Provides a framework for future research in cryptographic applications.
Abstract
We discuss heuristic asymptotic formulae for the number of pairing-friendly abelian varieties over prime fields, generalizing previous work of one of the authors arXiv:math1107.0307
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.