The method for elliptic curve scalar multiplication in an elliptic curve cryptosystem implemented over an insecure communications channel includes the steps of: (a) selecting positive integers Lx and Ly, where Lx and Ly are not both equal to 1, and where Ly≠3 if Lx=2; (b) representing coordinates of a point P=(x,y) on an elliptic curve of the form F(x,y)=y2−x3−ax−b=0 defined over a finite field as projective coordinates according to transforms
respectively; and (c) adding together K copies, K being a scalar, of the point P(X,Y,ZL<sub2>x</sub2>,ZL<sub2>y</sub2>) to obtain the scalar multiplication product KP. The scalar multiplication product is then converted from parameterized projective coordinates P(X,Y,ZL<sub2>x</sub2>,ZL<sub2>y</sub2>) to affine coordinates P(x,y). The method is optimized by restricting Ly so that Ly−Lx≧0 or, alternatively, so that Ly=Lx. The method may be carried out on a cryptographic device, which may be a computer, a (cellular) telephone, a smart card, an ASIC, or the like.