NobleBlocks
Public

New Greedy Algorithm for Computing Double-Base Chains

Published • Jan 1, 2009
NobleIDNI7P76W00R04S49
Authors:
Ming Li
,
Kunpeng Wang

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 ell...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!