A Fast Point Multiplication Algorithm for Elliptic Curve Cryptosystems Based on Integer Splitting
Cheng Zhong · Computer Engineering and Science · 2005
In elliptic curve cryptosystems, point multiplication kP is the core operation, where P is a point on the elliptic curve and P is an integer. How to improve the speed of computing point multiplication has become a hot research field. This paper presents a new fast algorithm for point multiplication based on integer splitting and precomputing.