Implementing optimized pairings with elliptic nets

被引：0
作者：
ChunMing Tang
DongMei Ni
MaoZhi Xu
BaoAn Guo
YanFeng Qi
机构：
[1] China West Normal University,School of Mathematics and Information
[2] Peking University,LMAM, Chinese Ministry of Education
[3] Peking University,School of Mathematical Sciences
[4] Aisino Corporation Inc.,undefined
来源：
Science China Information Sciences | 2014年 / 57卷
关键词：
elliptic curves; elliptic nets; pairings; Miller’s algorithm; pairing-based cryptography;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we use elliptic nets to implement the optimized Ate pairings and optimal pairings on the Barreto-Naehrig curves with embedding degree 12. In order to do the arithmetic of elliptic curves over finite fields with elliptic nets, we first give some basic properties of elliptic nets associated to elliptic curves over finite fields and the expression of Miller function in terms of elliptic nets. Then we give formulae to compute some optimized pairings with elliptic nets, which is a new method to implement pairings. This method with elliptic nets has time complexity comparable to Miller’s algorithm and it can be optimized.
引用
收藏
页码：1 / 10
页数：9
相关论文
共 33 条
  • [21] Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
    Costello, Craig
    Lauter, Kristin
    Naehrig, Michael
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2011, 2011, 7107 : 320 - +
  • [22] On symmetries of elliptic nets and valuations of net polynomials
    Akbary, Amir
    Bleaney, Jeff
    Yazdani, Soroosh
    JOURNAL OF NUMBER THEORY, 2016, 158 : 185 - 216
  • [23] A NEW VERIFIABLE MULTI-SECRET SHARING SCHEME BASED ON ELLIPTIC CURVES AND PAIRINGS
    Bahramian, Mojtaba
    Eslami, Khadijeh
    ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2019, (41): : 456 - 468
  • [24] An Explicit Formula of Cyclotomic Cubing Available for Pairings on Elliptic Curves with Embedding Degrees of Multiple of Three
    Nanjo, Yuki
    Shirase, Masaaki
    Kusaka, Takuya
    Nogami, Yasuyuki
    35TH INTERNATIONAL TECHNICAL CONFERENCE ON CIRCUITS/SYSTEMS, COMPUTERS AND COMMUNICATIONS (ITC-CSCC 2020), 2020, : 288 - 292
  • [25] FPGA Implementation of Various Elliptic Curve Pairings over Odd Characteristic Field with Non Supersingular Curves
    Nogami, Yasuyuki
    Kagotani, Hiroto
    Iokibe, Kengo
    Miyatake, Hiroyuki
    Narita, Takashi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016, E99D (04): : 805 - 815
  • [26] Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
    Morain, F.
    MATHEMATICS OF COMPUTATION, 2006, 76 (257) : 493 - 505
  • [27] Efficient Identity-Based Parallel Key-Insulated Signature Scheme using Pairings over Elliptic Curves
    Amarapu, R. B.
    Reddy, P. V.
    JOURNAL OF SCIENTIFIC & INDUSTRIAL RESEARCH, 2018, 77 (01): : 24 - 28
  • [28] Complete Analysis of Implementing Isogeny-Based Cryptography Using Huff Form of Elliptic Curves
    Kim, Suhri
    IEEE ACCESS, 2021, 9 : 154500 - 154512
  • [29] Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0
    Hu, Zhi
    Longa, Patrick
    Xu, Maozhi
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 63 (03) : 331 - 343
  • [30] Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0
    Zhi Hu
    Patrick Longa
    Maozhi Xu
    Designs, Codes and Cryptography, 2012, 63 : 331 - 343
1234