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 条
  • [21] CONSTRUCTING PAIRING-FRIENDLY CURVES WITH VARIABLE CM DISCRIMINANT
    Lee, Hyang-Sook
    Park, Cheol-Min
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2012, 49 (01) : 75 - 88
  • [22] Hashing to G(2) on BLS pairing-friendly curves
    Budroni, Alessandro
    Pintore, Federico
    ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 2018, 52 (03): : 63 - 66
  • [23] More Sparse Families of Pairing-Friendly Elliptic Curves
    Fotiadis, Georgios
    Konstantinou, Elisavet
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2014, 2014, 8813 : 384 - 399
  • [24] Generating pairing-friendly elliptic curves with fixed embedding degrees
    Liang Li
    Science China Information Sciences, 2017, 60
  • [25] Generating Pairing-Friendly Curves with the CM Equation of Degree 1
    Lee, Hyang-Sook
    Park, Cheol-Min
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2009, 2009, 5671 : 66 - 77
  • [26] Fast Hashing to G2 on Pairing-Friendly Curves
    Scott, Michael
    Benger, Naomi
    Charlemagne, Manuel
    Perez, Luis J. Dominguez
    Kachisa, Ezekiel J.
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2009, 2009, 5671 : 102 - 113
  • [27] Generating pairing-friendly elliptic curves with fixed embedding degrees
    Li, Liang
    SCIENCE CHINA-INFORMATION SCIENCES, 2017, 60 (11)
  • [28] Generating Pairing-Friendly Elliptic Curves Using Parameterized Families
    Zhang, Meng
    Xu, Maozhi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2018, E101A (01): : 279 - 282
  • [29] Constructing pairing-friendly genus 2 curves with ordinary jacobians
    Freeman, David
    Pairing-Based Cryptography - Pairing 2007, 2007, 4575 : 152 - 176
  • [30] Generating pairing-friendly elliptic curves with fixed embedding degrees
    Liang LI
    Science China(Information Sciences), 2017, 60 (11) : 278 - 280