- 期刊
Speeding up Pairing Computation Using Non-adjacent Form and ELM Method
並列摘要
The bilinear pairings such as Weil pairing and Tate pairing on elliptic curves have recently found many applications in cryptography. The first efficient algorithm for computing pairing was originally proposed by Miller and much subsequent research has been directed at many different aspects in order to improve efficiency. In 2003, Eisenträger, Lauter and Montgomery proposed a new point-double-addition method to speed up elliptic curve arithmetic computation and obtained a 7.8% performance improvement of the Miller algorithm of a general elliptic curve. In 2006, Blake et al. proposed a new concept based on the conjugate of a line to reduce the total number of lines in the Miller algorithm. In this paper we propose an enhancement of Eisenträger et al.'s algorithm for computing pairings. Our enhancement can further speed up the pairing computation by 5.9%.
被引用紀錄
延伸閱讀
- 梁宏達（2007）。Design and Implementation of content-free computer support for Self-Explaining〔碩士論文，元智大學〕。華藝線上圖書館。https://doi.org/10.6838/YZU.2007.00303
- Wang, H. W. (2014). Apply Abstraction Techniques to Embedded System Debug [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2014.10917
- 徐德發（2010）。Code Generation with a Least-Cost Parsing Technique〔碩士論文，國立交通大學〕。華藝線上圖書館。https://doi.org/10.6842/NCTU.2010.00836
- 張逸中（2012）。Techniques and Applications of Embedding Web Program into Windows Program。台灣首府大學學報，(3)，81-92。https://doi.org/10.6607/BTSU.2012.3.5
- 游坤明、林仕奇（2006）。Design an Efficient Incremental Data Mining Algorithm Based on Pre_large Technique。Journal of Information Technology and Applications(資訊科技與應用期刊)，1(2)，133-143。https://doi.org/10.6302/JITA.200609_1(2).0008