透過您的圖書館登入
IP:18.191.240.243
  • 期刊

Expansion of Sliding Window Method for Finding Shorter Addition/Subtraction-Chains

並列摘要


Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtraction-chain. The proposed algorithm is based on the small-window method, and reduces the number of windows by using subtractions. We show the proposed algorithm finds the shorter addition/subtraction-chain than what can be found by any other previous algorithm.

被引用紀錄


Wang, C. Y. (2007). 奈米碳管/高分子之微波熔接特性與其應用 [doctoral dissertation, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-1411200715095359
Chen, B. Y. (2008). 以網路處理器設計與實作SIP為基礎之網路電話系統 [master's thesis, National Formosa University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0028-1501201314421434
Lin, H. (2015). 利用移動式中繼節點之耐延遲網路下訊息傳遞機制 [master's thesis, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-0412201512100708

延伸閱讀