Fast Algorithm of Scalar Multiplication on Emptic Curve Cryptosystem
Fan Heng-ying · Journal of Southwest University of Science and Technology · 2011
Elliptic Curve Cryptosystem(ECC) is one of the most effective public-key cryptosystems,shorter key,higher security.Point multiplication and scalar multiplication of points are key operations in elliptic curve cryptograph.They are the the costliest computations.Width-w non-adjacent-form(w-NAF) algorithm is usually used to speed up the operation of the point multiplication on elliptic curves cryptograph.Some improvements are done to make it more effective in this paper.Furthermore,a new algorithm of double scalar multiplication is put forward combine with the subsection and parallel method.This paper gives a detailed analysis and precise measure of the new algorithm.The improved algorithm is much more efficient than before,thus making it a functional algorithm of excellent value.