Title :
New Greedy Algorithm for Computing Double-Base Chains
Author :
Li, Ming ; Wang, Kunpeng
Author_Institution :
State Key Lab. of Inf. Security, Grad. Univ. of Chinese Acad. of Sci., Beijing, China
Abstract :
We improve the greedy algorithm which converts integers into double-base chains by introducing tree structure. The new method accelerates the convergence of greedy algorithm, which makes the double-base expansions shorter than before. And it reduces the cost of computing scalar multiplication on elliptic curves. Furthermore, new algorithm performs well in flexibility. We could adjust it to return more efficient expansions for scalar multiplication on special curves. We also discuss the impact of parameters on the performance of new method.
Keywords :
greedy algorithms; public key cryptography; double-base chains; elliptic curve cryptography; greedy algorithm; scalar multiplication; tree structure; Acceleration; Convergence; Costs; Elliptic curve cryptography; Elliptic curves; Greedy algorithms; Information security; Laboratories; Public key cryptography; Tree data structures; Double-Base Chain; Elliptic Curve Cryptography; Greedy Algorithm; Scalar Multiplication;
Conference_Titel :
Information Assurance and Security, 2009. IAS '09. Fifth International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-0-7695-3744-3
DOI :
10.1109/IAS.2009.207
