Faster elliptic curve point multiplication based on a novel greedy base-2,3 method

In this paper a novel pre-computation technique for scalar point multiplication on elliptic curves is proposed. Compared to standard affine coordinates without pre-computation this method achieves a performance increase of 23% while requiring an additional increase in control and logic for the pre-computation step. This method achieves a (2m bits /spl times/ numpoints) reduction in storage overhead compared with other pre-computation techniques.