• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • David Gruenewald
  • Heuristics on pairing-friendly abelian varieties
  • 3pm–4pm, Thursday 18th April, 2013
  • Carslaw 535
  • We present heuristic asymptotic formulae for the number of isogeny classes of pairing-friendly abelian varieties (PFAVs) over prime fields, generalising previous work of John Boxall on elliptic curves. By enumerating Weil numbers satisfying "pairing-friendly" conditions we were able to count the number of PFAVs and compare with the heuristic value. In all the examples we computed, the results show good agreement with the heuristics.

The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.