Efficient computation of pairings on Jacobi quartic elliptic curves

被引:2
|
作者
Duquesne, Sylvain [1 ]
El Mrabet, Nadia [2 ]
Fouotsa, Emmanuel [3 ]
机构
[1] Univ Rennes 1, UMR CNRS 6625, IRMAR, Campus Beaulieu, F-35042 Rennes, France
[2] Univ Paris 08, Lab Informat Avance St Denis, F-93526 St Denis, France
[3] Univ Bamenda, Higher Teacher Training Coll, Dept Math, Bamenda, Cameroon
关键词
Jacobi quartic curves; Tate pairing; Ate pairing; twists; Miller function;
D O I
10.1515/jmc-2013-0033
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper proposes the computation of the Tate pairing, Ate pairing and its variations on the special Jacobi quartic elliptic curve Y-2 = dX(4) + Z(4). We improve the doubling and addition steps in Miller's algorithm to compute the Tate pairing. We use the birational equivalence between Jacobi quartic curves andWeierstrass curves, together with a specific point representation to obtain the best result to date among curves with quartic twists. For the doubling and addition steps in Miller's algorithm for the computation of the Tate pairing, we obtain a theoretical gain up to 27% and 39%, depending on the embedding degree and the extension field arithmetic, with respect to Weierstrass curves and previous results on Jacobi quartic curves. Furthermore and for the first time, we compute and implement Ate, twisted Ate and optimal pairings on the Jacobi quartic curves. Our results are up to 27% more efficient compared to the case of Weierstrass curves with quartic twists.
引用
收藏
页码:331 / 362
页数:32
相关论文
共 50 条
  • [1] Pairing Computation on Elliptic Curves of Jacobi Quartic Form
    Wang Hong
    Wang Kunpeng
    Zhang Lijun
    Li Bao
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2011, 20 (04) : 655 - 661
  • [2] Pairing computation on elliptic curves of Jacobi quartic form
    State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100049, China
    [J]. Chin J Electron, 4 (655-661):
  • [3] An optimal Tate pairing computation using Jacobi quartic elliptic curves
    Srinath Doss
    Roselyn Kaondera-Shava
    [J]. Journal of Combinatorial Optimization, 2018, 35 : 1086 - 1103
  • [4] An optimal Tate pairing computation using Jacobi quartic elliptic curves
    Doss, Srinath
    Kaondera-Shava, Roselyn
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (04) : 1086 - 1103
  • [5] Pairings on elliptic curves
    Katholieke Universiteit Leuven, Belgium
    [J]. Cryptology Inf. Secur. Ser., 2009, (13-30):
  • [6] Pairing Computation in Jacobi Quartic Curves Using Weight Projective Coordinates
    Ren, Yajuan
    [J]. PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON SENSOR NETWORK AND COMPUTER ENGINEERING, 2016, 68 : 93 - 97
  • [7] Hashing into Jacobi Quartic Curves
    Yu, Wei
    Wang, Kunpeng
    Li, Bao
    He, Xiaoyang
    Tian, Song
    [J]. INFORMATION SECURITY, ISC 2015, 2015, 9290 : 355 - 375
  • [8] Jacobi Quartic Curves Revisited
    Hisil, Huseyin
    Wong, Kenneth Koon-Ho
    Carter, Gary
    Dawson, Ed
    [J]. INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2009, 5594 : 452 - 468
  • [9] Faster Pairing Computation on Jacobi Quartic Curves with High-Degree Twists
    Zhang, Fan
    Li, Liangze
    Wu, Hongfeng
    [J]. TRUSTED SYSTEMS, INTRUST 2014, 2015, 9473 : 310 - 327
  • [10] Pairings in the arithmetic of elliptic curves
    Mazur, B
    Rubin, K
    [J]. MODULAR CURVES AND ABELIAN VARIETIES, 2004, 224 : 151 - 163