Speeding up Pairing Computation Using Non-adjacent Form and ELM Method

ASIA unversity > 資訊學院 > 行動商務與多媒體應用學系 > 期刊論文 > Item 310904400/101258

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/101258

題名:	Speeding up Pairing Computation Using Non-adjacent Form and ELM Method
作者:	Tsai；, 劉兆樑；Chao-Liang Liu；Gwoboa Horng；Gwoboa Horng；Du-Shiau Tsa；Du-Shiau
貢獻者:	行動商務與多媒體應用學系
日期:	2016-01
上傳時間:	2016-09-20 03:29:28 (UTC+0)
摘要:	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%.
關聯:	International Journal of Network Security
顯示於類別:	[行動商務與多媒體應用學系] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML	279	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.