Improvement of Scalar Multiplication Algorithm in Elliptic Curve
Wei Ji · Jisuanji gongcheng · 2008
In accordance with the problem that the fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalarmultiplication, this paper improves the mixed binary and ternary method to express n, generalizes the mixed binary, ternary and quinary method toexpress n .Based on the computation of double point, triple point, and quintuple point, it computes scalar multiplication nP by using properoperations.Results show that the approaches lead to lower complexity which contributes to the efficient implementation of elliptic curve scalarmultiplication.