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...
Saved in:
Main Authors: | Mohamad Afendee, Mohamed, Mohamad Rushdan, Md Said |
---|---|
格式: | Article |
语言: | 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, et al.
出版: (2015) -
Performance comparison of some addition chain methods based on integer family
由: Mohd Fadzil, Abdul Kadir, et al.
出版: (2019) -
A Faster External Sorting Algorithm Using No Additional Disk Space
由: Islam, Md. Rafiqul, et al.
出版: (2006) -
Faster computation of non-zero invariants from graph based method
由: Abdul Hameed, Vazeerudeen, et al.
出版: (2012) -
An improved binary method for scalar multiplication in elliptic curve cryptography
由: Mohamed, Mohamad Afendee, et al.
出版: (2010)