Efficient computation of multiple points for elliptic curve cryptosystems

A general sliding window method for computing m/sub 1/P/sub 1/+...+m/sub k/P/sub k/ for nonsupersingular curves is presented. Its performance analysis and various speed-up schemes are discussed.