Subsection simultaneous fast scalar multiplication algorithm based on Montgomery algorithm
Zhang Dong · Computer Engineering and Applications Journal · 2010
In the elliptic curve binary field,it needs less computation amount for that the Montgomery algorithm only computes the x coordinate in the whole course and gets the y coordinate in the last step.A new computational algorithm based on the Montgomery subsection method is proposed to enhance the efficiency further for computer kP,the computation amount decreases 25% for the new algorithm of two subsection and 37% for the new algorithm of three subsection compared with the original algorithm.The efficiency of the new algorithm is proved to be improved by the program implementation.The new algorithm possesses good performance on elliptic curve scalar multiplication.