Pairing Computation on Elliptic Curves of Jacobi Quartic Form

被引：0

作者：

Wang Hong ^{[1
]}

Wang Kunpeng ^{[1
]}

Zhang Lijun ^{[1
]}

Li Bao ^{[1
]}

机构：

[1] Chinese Acad Sci, Grad Univ, State Key Lab Informat Secur, Beijing 100049, Peoples R China

来源：

CHINESE JOURNAL OF ELECTRONICS | 2011年 / 20卷 / 04期

基金：

中国国家自然科学基金; 国家高技术研究发展计划(863计划);

关键词：

Elliptic curve; Jacobi quartic curve; Tate pairing; Miller function; Group law; Geometric interpretation;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper proposes explicit formulae for the addition step and doubling step in Miller's algorithm to compute Tate pairing on Jacobi quartic curves. We present a geometric interpretation of the group law on Jacobi. quartic curves, which leads to formulae for Miller's algorithm. The doubling step formula is competitive with that for Weierstrass curves and Edwards curves. Moreover, by carefully choosing the coefficients, there exist quartic twists of Jacobi quartic curves from which pairing computation can benefit a lot. Finally, we provide some examples of supersingular and ordinary pairing friendly Jacobi quartic curves.

引用

页码：655 / 661

页数：7

共 50 条

[11] Hashing into Jacobi Quartic Curves
Yu, Wei
Wang, Kunpeng
Li, Bao
He, Xiaoyang
Tian, Song
INFORMATION SECURITY, ISC 2015, 2015, 9290 : 355 - 375
[12] Jacobi Quartic Curves Revisited
Hisil, Huseyin
Wong, Kenneth Koon-Ho
Carter, Gary
Dawson, Ed
INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2009, 5594 : 452 - 468
[13] Optimal pairing computation over families of pairing-friendly elliptic curves
Eom, Soo-Kyung
Lee, Hyang-Sook
Park, Cheol-Min
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2011, 22 (04) : 235 - 248
[14] Optimal pairing computation over families of pairing-friendly elliptic curves
Soo-Kyung Eom
Hyang-Sook Lee
Cheol-Min Park
Applicable Algebra in Engineering, Communication and Computing, 2011, 22 : 235 - 248
[15] Division Polynomials for Jacobi Quartic Curves
Moody, Dustin
ISSAC 2011: PROCEEDINGS OF THE 36TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2011, : 265 - 272
[16] Efficient Tate pairing computation for elliptic curves over binary fields
Kwon, S
INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2005, 3574 : 134 - 145
[17] Faster Ate pairing computation on Selmer's model of elliptic curves
Fouotsa, Emmanuel
Ciss, Abdoul Aziz
GROUPS COMPLEXITY CRYPTOLOGY, 2016, 8 (01) : 55 - 67
[18] Arithmetic progressions on quartic elliptic curves
Alvarado, Alejandra
ANNALES MATHEMATICAE ET INFORMATICAE, 2010, 37 : 3 - 6
[19] On Elliptic Curves and Binary Quartic Forms
Duke, W.
INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2022, 2022 (23) : 19078 - 19104
[20] Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Ionica, Sorina
Joux, Antoine
PAIRING-BASED CRYPTOGRAPHY-PAIRING 2010, 2010, 6487 : 435 - 449

← 1 2 3 4 5 →