Heuristics on pairing-friendly abelian varieties

被引:1
|
作者
Boxall, John [1 ]
Gruenewald, David [2 ]
机构
[1] Univ Caen Basse Normandie, Lab Math Nicolas Oresme, CNRS, UMR 6139, F-14032 Caen 5, France
[2] Univ Sydney, Sch Math & Stat, Sydney, NSW 2006, Australia
来源
关键词
ELLIPTIC-CURVES; ISOGENY CLASSES;
D O I
10.1112/S1461157015000091
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We discuss heuristic asymptotic formulae for the number of isogeny classes of pairing-friendly abelian varieties of fixed dimension g 2 over prime finite fields. In each formula, the embedding degree k 2 is fixed and the rho-value is bounded above by a fixed real rho(0) > 1. The first formula involves families of ordinary abelian varieties whose endomorphism ring contains an order in a fixed CM-field K of degree g and generalizes previous work of the first author when g = 1. It suggests that, when rho(0) < g, there are only finitely many such isogeny classes. On the other hand, there should be infinitely many such isogeny classes when rho(0) > g. The second formula involves families whose endomorphism ring contains an order in a fixed totally real field K6 of degree g. It suggests that, when rho(0) > 2g/(g + 2) (and in particular when rho(0) > 1 if g = 2), there are infinitely many isogeny classes of g-dimensional abelian varieties over prime fields whose endomorphism ring contains an order of K-0(+) We also discuss the impact that polynomial families of pairing friendly abelian varieties has on our heuristics, and review the known cases where they are expected to provide more isogeny classes than predicted by our heuristic formulae.
引用
收藏
页码:419 / 443
页数:25
相关论文
共 50 条
  • [1] On Cycles of Pairing-Friendly Abelian Varieties
    Santos, Maria Corte-Real
    Costello, Craig
    Naehrig, Michael
    ADVANCES IN CRYPTOLOGY - CRYPTO 2024, PT IX, 2024, 14928 : 221 - 253
  • [2] Pairing-Friendly Primes for Abelian Varieties
    Grzeskowiak, Maciej
    FUNDAMENTA INFORMATICAE, 2016, 149 (04) : 385 - 400
  • [3] Heuristics on pairing-friendly elliptic curves
    Boxall, John
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2012, 6 (02) : 81 - 104
  • [4] On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
    Benger, Naomi
    Charlemagne, Manuel
    Freeman, David Mandell
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2009, 2009, 5671 : 52 - +
  • [5] A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
    Freeman, David
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008, 2008, 5209 : 146 - 163
  • [6] A New Method for Constructing Pairing-Friendly Abelian Surfaces
    Drylo, Robert
    PAIRING-BASED CRYPTOGRAPHY-PAIRING 2010, 2010, 6487 : 298 - 311
  • [7] On the selection of pairing-friendly groups
    Barreto, PSLM
    Lynn, B
    Scott, M
    SELECTED AREAS IN CRYPTOGRAPHY, 2004, 3006 : 17 - 25
  • [8] A Taxonomy of Pairing-Friendly Elliptic Curves
    Freeman, David
    Scott, Michael
    Teske, Edlyn
    JOURNAL OF CRYPTOLOGY, 2010, 23 (02) : 224 - 280
  • [9] Constructing Pairing-friendly Elliptic Curve
    Dai, Guangming
    Wang, Maocai
    Pen, Lei
    Hu, Hanping
    2012 WORLD AUTOMATION CONGRESS (WAC), 2012,
  • [10] A Taxonomy of Pairing-Friendly Elliptic Curves
    David Freeman
    Michael Scott
    Edlyn Teske
    Journal of Cryptology, 2010, 23 : 224 - 280