您当前的位置:
首页 >
文章列表页 >
Refinements of Double-Base Chains Algorithm for Computing Tate Pairing
更新时间:2025-07-16
    • Refinements of Double-Base Chains Algorithm for Computing Tate Pairing

    • Acta Electronica Sinica   Vol. 40, Issue 9, Pages: 1775-1782(2012)
    • DOI:10.3969/j.issn.0372-2112.2012.09.012    

      CLC: TP309
    • Published:2012

    移动端阅览

  • WENG Jiang, DOU Yun-qi, MA Chuan-gui. Refinements of Double-Base Chains Algorithm for Computing Tate Pairing[J]. Acta Electronica Sinica, 2012, 40(9): 1775-1782. DOI: 10.3969/j.issn.0372-2112.2012.09.012.

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

1434

下载量

1

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Fast Tate Pairing Algorithm Using Double-Base Chains
GLV/GLS Scalar Multiplication on Jacobi Quartic Curves
Privacy-Enhancing Authenticated Key Agreement Protocols Based on Elliptic Curve Cryptosystem
A New Method of Scalar Multiplication of Elliptic Curve over OEF

Related Author

MA Chuan-gui
CHEN Hou-you
JI Wei-feng
MENG Hao
ZHANG Lin-feng
LI Ying-qi
WU Xuan
WENG Jiang

Related Institution

Zhengzhou Information Science and Technology Institute
School of Network and Information Security, Xidian University
Information and Navigation College, Air Force Engineering University
Unit 10, Courtyard 14, Fuxing Road
Institute of Electronic Technology, the PLA Information Engineering University
0