Abstract
The major building block of most elliptic curve cryptosystems are computation of multi-scalar multiplication. This paper proposes a novel algorithm for simultaneous multi-scalar multiplication, that is by employing addition chains. The previously known methods utilizes double-and-add algorithm with binary representations. In order to accomplish our purpose, an efficient empirical method for finding addition chains for multi-exponents has been proposed. Keywords—elliptic curve cryptosystems, multi-scalar multiplication, addition chains, Fibonacci sequence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have