Efficient Tate pairing computation using double-base chains

被引：0
|
作者：
ZHAO ChangAn
机构：
来源：
Science China(Information Sciences) | 2008年 / 08期
基金：
中国国家自然科学基金;
关键词：
public key cryptography; Tate pairing; elliptic curves; double-base chains;
D O I：
暂无
中图分类号：
TP11 [自动化系统理论];
学科分类号：
0711 ; 071102 ; 0811 ; 081101 ; 081103 ;
摘要：
Pairing-based cryptosystems have developed very fast in the last few years.The effi-ciencies of these cryptosystems depend on the computation of the bilinear pairings.In this paper,a new efficient algorithm based on double-base chains for computing the Tate pairing is proposed for odd characteristic p>3.The inherent sparseness of double-base number system reduces the computational cost for computing the Tate pairing evidently.The new algorithm is 9% faster than the previous fastest method for the embedding degree k=6.
引用
收藏
页码：1096 / 1105
页数：10
相关论文
共 50 条
  • [1] Efficient Tate pairing computation using double-base chains
    ChangAn Zhao
    FangGuo Zhang
    JiWu Huang
    Science in China Series F: Information Sciences, 2008, 51
  • [2] Efficient Tate pairing computation using double-base chains
    Zhao ChangAn
    Zhang FangGuo
    Huang JiWu
    SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 51 (08): : 1096 - 1105
  • [3] Efficient and secure elliptic curve point multiplication using double-base chains
    Dimitrov, V
    Imbert, L
    Mishra, PK
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2005, 2005, 3788 : 59 - 78
  • [4] A method for efficient parallel computation of Tate pairing
    Su, Zhitu
    Sun, Chunhui
    Li, Hui
    Ma, Jianfeng
    INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2012, 3 (01) : 43 - 52
  • [5] New Greedy Algorithm for Computing Double-Base Chains
    Li, Ming
    Wang, Kunpeng
    FIFTH INTERNATIONAL CONFERENCE ON INFORMATION ASSURANCE AND SECURITY, VOL 1, PROCEEDINGS, 2009, : 445 - 450
  • [6] Double-Base Chains for Scalar Multiplications on Elliptic Curves
    Yu, Wei
    Al Musa, Saud
    Li, Bao
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT III, 2020, 12107 : 538 - 565
  • [7] Faster computation of the Tate pairing
    Arene, Christophe
    Lange, Tanja
    Naehrig, Michael
    Ritzenthaler, Christophe
    JOURNAL OF NUMBER THEORY, 2011, 131 (05) : 842 - 857
  • [8] Powered Tate pairing computation
    Kang, Bo Gyeong
    Park, Je Hong
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (01) : 338 - 341
  • [9] On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography
    Doche, Christophe
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2014, PT I, 2014, 8873 : 297 - 316
  • [10] Efficient Tate pairing computation for elliptic curves over binary fields
    Kwon, S
    INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2005, 3574 : 134 - 145
12345