Abstract
There are various expansion methods to accelerate scalar multiplication on special types of elliptic curves. In this paper we present a general expansion method that uses efficient endomorphisms. We first show that the set of all endomorphisms over a non-supersingular elliptic curve E is isomorphic to Z[ ω ] = { a + bω | a,bin Z }, where ω is an algebraic integer with the smallest norm in an imaginary quadratic field, if ω is an endomorphism over E. Then we present a new division algorithm in Z[ ω ], by which an integer k can be expanded by the Frobenius endomorphism and ω. If ω is more efficient than a point doubling, we can use it to improve the performance of scalar multiplication by replacing some point doublings with the ω maps. As an instance of this general method, we give a new expansion method using the efficiently computable endomorphisms used by Ciet et al. [1].
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call