New formulae for Tate pairing computation on Weierstrass curves

doi:10.1016/S1005-8885(13)60054-0

中国邮电高校学报(英文) ›› 2013, Vol. 20 ›› Issue (3): 85-89.doi: 10.1016/S1005-8885(13)60054-0

• Artificial Intelligence • 上一篇下一篇

New formulae for Tate pairing computation on Weierstrass curves

汪宏¹,宋俊德²,王鲲鹏³

1. School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China 2. Venustech Cybervision Co., Ltd., Zhong Guancun Science Park Haidian Enterprises Postdoctoral Workstation, Beijing 100193, China 3. Institute of Information Engineering, University of Chinese Academy of Sciences, Beijing 100093, China

收稿日期:2013-05-06 修回日期:2013-05-27 出版日期:2013-06-30 发布日期:2013-06-26
通讯作者: 汪宏 E-mail:wanghong05@mails.ucas.ac.cn
基金资助:
This work was supported by Haidian Technology Park enterprise postdoctoral funded project, Chinese Academy of Sciences strategic pilot science and technology projects (XDA06010702) and the National Natural Science Foundation of China (60970153, 61272040).

New formulae for Tate pairing computation on Weierstrass curves

1. School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China 2. Venustech Cybervision Co., Ltd., Zhong Guancun Science Park Haidian Enterprises Postdoctoral Workstation, Beijing 100193, China 3. Institute of Information Engineering, University of Chinese Academy of Sciences, Beijing 100093, China

Received:2013-05-06 Revised:2013-05-27 Online:2013-06-30 Published:2013-06-26
Contact: Hong Wang E-mail:wanghong05@mails.ucas.ac.cn
Supported by:
This work was supported by Haidian Technology Park enterprise postdoctoral funded project, Chinese Academy of Sciences strategic pilot science and technology projects (XDA06010702) and the National Natural Science Foundation of China (60970153, 61272040).

摘要/Abstract

摘要：

This paper proposes a variation of Miller’s algorithm for Tate pairing computation on Weierstrass curves. Unlike the original Miller’s algorithm which consists of two major operations: the doubling operation and the addition operation, this new algorithm replaces the addition with a doubling-addition (DA) operation to take the advantage of the fast point doubling-addition formula. Explicit formulae are given for the new algorithm. We suggest to use the new formulae for Weierstrass curves with general parameters for Tate pairing to gain a better performance.

关键词:

elliptic curve, Weierstrass, Tate pairing, Miller function

Abstract:

Key words:

elliptic curve, Weierstrass, Tate pairing, Miller function

WANG Hong, WANG Kun-peng, SONG Jun-de. New formulae for Tate pairing computation on Weierstrass curves[J]. Acta Metallurgica Sinica(English letters), 2013, 20(3): 85-89.

参考文献

1. Boneh D, Franklin M. Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 2003, 32(3): 586-615

2. Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. Journal of Cryptology, 2004, 17(4): 297-319

3. Dutta R, Barua R, Sarkar P. Pairing-based cryptographic protocols: a survey. Cryptology ePrint Archive, Report 2004/064. 2004

4. Costello C, Hisil H, Boyd C, et al. Faster pairings on special Weierstrass curves. Proceedings of the 3rd International Conference on Pairing-based Cryptography (Pairing’09), Aug 11-14, 2009, Palo Alto, CA, USA. LNCS 5671. Berlin, Germany: Springer-Verlag, 2009: 89-101

5. Cheng Z, Nistazakis M. Implementing pairing-based cryptosystems. Proceedings of the 3rd International Workshop on Wireless Security Technologies (IWWST’05), Apr 4-5, 2005, London, UK. 2005

6. Chatterjee S, Sarkar P, Barua R. Efficient computation of Tate pairing in projective coordinate over general characteristic fields. Proceedings of the 7th International Conference on Information Security and Cryptology (ICISC’04), Dec 2-3, 2004, Seoul, Republic of Korea. LNCS 3506. Berlin, Germany: Springer-Verlag, 2005: 168-181

7. Ionica S, Joux A. Another approach to pairing computation in Edwards coordinates. Proceedings of the 9th International Conference on Cryptology in India (INDOCRYPT’08), Dec 14-17, 2008, Kharagpur, India. LNCS 5365. Berlin, Germany: Springer-Verlag, 2008: 400-413

8. Arene C, Lange T, Naehrig M, et al. Faster computation of the Tate pairing. Journal of Number Theory, 2011,131(5): 842-857

9. Barreto P S L M, Kim H Y, Lynn B, et al. Efficient algorithms for pairing-based cryptosystems. Proceedings of the 22nd Annual International Cryptology Conference (Crypto’01), Aug 18-22, 2001, Santa Barbara, CA, USA. LNCS 2442. Berlin, Germany: Springer-Verlag, 2002: 354-368

10. Costello C, Lange T, Naehrig M. Faster pairing computations on curves with high-degree twists. Public Key Cryptography: Proceedings of the 13th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC’10), May 26-28, 2010, Paris, France. LNCS 6056. Berlin, Germany: Springer-Verlag, 2010: 224-242

11. Hess F. Pairing lattices. Proceedings of the 2nd International Conference on Pairing-based Cryptography (Pairing’08), Sept 1-3, Egham, UK. LNCS 5209. Berlin, Germany: Springer-Verlag, 2008: 18-38

12. Meloni N. New point addition formulae for ECC applications. Proceedings of the 1st International Workshop on the Arithmetic of Finite Fields (WAIFI’07), Jun 21-22, 2007, Madrid, Spain. LNCS 4547. Berlin, Germany: Springer-Verlag, 2007: 189-201

13. Longa P, Miri A. New composite operations and precomputation scheme for Elliptic curve cryptosystems over prime fields. Public Key Cryptography: Proceedings of the 11th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC’08), May 9-12, 2008, Barcelona, Spain. LNCS 4939. Berlin, Germany: Springer-Verlag, 2008: 229-247

14. Goundar R R, Joye M, Miyaji A. Co-Z addition formulae and binary ladders on elliptic curves. Proceedings of the 12th International Workshop Cryptographic Hardware and Embedded Systems (CHES’10), Aug 17-20, 2010, Santa Barbara, CA, USA. LNCS 6225. Berlin, Germany: Springer-Verlag, 2010: 65-79

New formulae for Tate pairing computation on Weierstrass curves

New formulae for Tate pairing computation on Weierstrass curves

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

本文评价