An Improved Fast Point Multiplication Algorithm in Elliptic Curve Cryptography
Cai Chang-shu · Experiment Science and Technology · 2008
A fast algorithm for point multipoication based on 2k base point multiplication algorithm is proposed.It is fit for any binary length.Optimal k of the introduced 2k sequence representation for number is studied. A new method done by experiment to select k is proposed,then some values fitter for engineering of k are given.Experiment shows the new algorithm speeds up operation obviously on the 5 radom elliptic curves recommended by NIST over F'2.