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 条
  • [41] Faster Ate Pairing Computation over Pairing-Friendly Elliptic Curves Using GLV Decomposition
    Eom, Soo Kyung
    Lee, Eunjeong
    Lee, Hyang-Sook
    ETRI JOURNAL, 2013, 35 (05) : 880 - 888
  • [42] Pairing-Friendly Curves with Minimal Security Loss by Cheon's Algorithm
    Park, Cheol-Min
    Lee, Hyang-Sook
    ETRI JOURNAL, 2011, 33 (04) : 656 - 659
  • [43] Generating pairing-friendly elliptic curve parameters using sparse families
    Fotiadis, Georgios
    Konstantinou, Elisavet
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2018, 12 (02) : 83 - 99
  • [44] Experimantal Analysis of Cheon's Algorithm against Pairing-Friendly Curves
    Izu, Tetsuya
    Takenaka, Masahiko
    Yasuda, Masaya
    25TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA 2011), 2011, : 90 - 96
  • [45] On the rho-values of complete families of pairing-friendly elliptic curves
    Okano, Keiji
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2012, 6 (3-4) : 249 - 268
  • [46] Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves
    Fan, Junfeng
    Vercauteren, Frederik
    Verbauwhede, Ingrid
    IEEE TRANSACTIONS ON COMPUTERS, 2012, 61 (05) : 676 - 685
  • [47] Efficient and Generalized Pairing Computation on Abelian Varieties
    Lee, Eunjeong
    Lee, Hyang-Sook
    Park, Cheol-Min
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (04) : 1793 - 1803
  • [48] Efficient pairing computation on supersingular Abelian varieties
    Barreto, Paulo S. L. M.
    Galbraith, Steven D.
    O'hEigeartaigh, Colm
    Scott, Michael
    DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (03) : 239 - 271
  • [49] Efficient pairing computation on supersingular Abelian varieties
    Paulo S. L. M. Barreto
    Steven D. Galbraith
    Colm Ó’ hÉigeartaigh
    Michael Scott
    Designs, Codes and Cryptography, 2007, 42 : 239 - 271
  • [50] ON THE NUMBER OF ISOGENY CLASSES OF PAIRING-FRIENDLY ELLIPTIC CURVES AND STATISTICS OF MNT CURVES
    Jimenez Urroz, Jorge
    Luca, Florian
    Shparlinski, Igor E.
    MATHEMATICS OF COMPUTATION, 2012, 81 (278) : 1093 - 1110