頁籤選單縮合
題 名 | An Efficient Algorithm for Elliptic Curve Scalar Multiplication Using Extended Double-Base Chain and Point Halving |
---|---|
作 者 | Ding, Yong; Hong, Yinfang; Gui, Feng; Zheng, Zhaoxia; | 書刊名 | Journal of Internet Technology |
卷 期 | 12:4 2011.07[民100.07] |
頁 次 | 頁593-599 |
分類號 | 312.76 |
關鍵詞 | Elliptic curve cryptography; ECC; Scalar multiplication; Extended DBNS; Point halving; |
語 文 | 英文(English) |
英文摘要 | We propose to represent a scalar in the form of d(1/2)a3b, where a and b are integers and d is an odd integer belonging to a given set. This representation is a combination of the extended double-base number system (DBNS) and the double-base chain representation using powers of 1/2 and 3. Experimental results show that our approach leads to a shorter DBNS expansion and a lower complexity in elliptic curve scalar multiplication, with the cost of only a few pre-computations and storages. This contributes to the efficient implementation of elliptic curve cryptography (ECC). |
本系統中英文摘要資訊取自各篇刊載內容。