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 条
  • [31] Constructing pairing-friendly hyperelliptic curves using Weil restriction
    Freeman, David Mandell
    Satoh, Takakazu
    JOURNAL OF NUMBER THEORY, 2011, 131 (05) : 959 - 983
  • [32] An Algorithm to Generate Special Type of Pairing-Friendly Elliptic Curves
    Zhang, Meng
    Xu, Maozhi
    2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 123 - 126
  • [33] On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant
    Drylo, Robert
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2011, 2011, 7107 : 310 - 319
  • [34] Constructing pairing-friendly elliptic curves with embedding degree 10
    Freeman, David
    ALGORITHMIC NUMBER THEORY, PROCEEDINGS, 2006, 4076 : 452 - 465
  • [35] Constructing pairing-friendly genus 2 curves with split Jacobian
    Drylo, Robert
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7668 LNCS : 431 - 453
  • [36] Revisiting Pairing-Friendly Curves with Embedding Degrees 10 and 14
    Dai, Yu
    He, Debiao
    Peng, Cong
    Yang, Zhijian
    Zhao, Chang-an
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2024, PT II, 2025, 15485 : 454 - 485
  • [37] Constructing pairing-friendly elliptic curves using Grobner basis reduction
    Benits Junior, Waldyr D.
    Galbraith, Steven D.
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2007, 4887 : 336 - 345
  • [38] Constructing pairing-friendly elliptic curves using global number fields
    Yasuda, Takanori
    Takagi, Tsuyoshi
    Sakurai, Kouichi
    PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2015, : 477 - 483
  • [39] On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
    Sha, Min
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2014, 8 (04) : 417 - 440
  • [40] Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
    Tanaka, Satoru
    Nakamula, Ken
    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2008, 2008, 5209 : 136 - 145