Further Refinement of Pairing Computation Based on Miller''s Algorithm

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

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

題名:	Further Refinement of Pairing Computation Based on Miller''s Algorithm
作者:	劉兆樑;Liu, Chao-Liang
貢獻者:	資訊多媒體應用學系
日期:	2007-01
上傳時間:	2012-11-26 07:10:31 (UTC+0)
摘要:	In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate pairings. In this paper we extend their work and propose a generalized algorithm, which integrates their first two algorithms. Our approach is to pre-organize the binary representation of the involved integer to the best cases of Blake’s algorithms. Further, our refinement is more suitable for Solinas numbers than theirs. We analyze our algorithm and show that our refinement has better performance than the original algorithms.
關聯:	APPLIED MATHEMATICS AND COMPUTATION
顯示於類別:	[行動商務與多媒體應用學系] 期刊論文

文件中的檔案:

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

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