A hybrid addition chain method for faster scalar multiplication
Solutions to addition chain problem can be applied to operations involving huge number such as scalar multiplication in elliptic curve cryptography. Recently, a decomposition method was introduced, with an intention to generate addition chain with minimal possible terms. Totally different from oth...
保存先:
主要な著者: | Mohamad Afendee, Mohamed, Mohamad Rushdan, Md Said |
---|---|
フォーマット: | 論文 |
言語: | English |
出版事項: |
2015
|
主題: | |
オンライン・アクセス: | http://eprints.unisza.edu.my/5033/1/FH02-FIK-16-04820.pdf http://eprints.unisza.edu.my/5033/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
A hybrid addition chain method for faster scalar multiplication
著者:: Mohamed, Mohamad Afendee, 等
出版事項: (2015) -
Performance comparison of some addition chain methods based on integer family
著者:: Mohd Fadzil, Abdul Kadir, 等
出版事項: (2019) -
A Faster External Sorting Algorithm Using No Additional Disk Space
著者:: Islam, Md. Rafiqul, 等
出版事項: (2006) -
Faster computation of non-zero invariants from graph based method
著者:: Abdul Hameed, Vazeerudeen, 等
出版事項: (2012) -
Integer Sub-Decomposition (Isd)
Method For Elliptic Curve
Scalar Multiplication
著者:: Ajeena, Ruma Kareem K.
出版事項: (2015)