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 |
---|---|
Format: | Article |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | http://eprints.unisza.edu.my/5033/1/FH02-FIK-16-04820.pdf http://eprints.unisza.edu.my/5033/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A hybrid addition chain method for faster scalar multiplication
by: Mohamed, Mohamad Afendee, et al.
Published: (2015) -
Performance comparison of some addition chain methods based on integer family
by: Mohd Fadzil, Abdul Kadir, et al.
Published: (2019) -
A Faster External Sorting Algorithm Using No Additional Disk Space
by: Islam, Md. Rafiqul, et al.
Published: (2006) -
Faster computation of non-zero invariants from graph based method
by: Abdul Hameed, Vazeerudeen, et al.
Published: (2012) -
Integer Sub-Decomposition (Isd)
Method For Elliptic Curve
Scalar Multiplication
by: Ajeena, Ruma Kareem K.
Published: (2015)