Based on a pipelined linear array for high radix Montgomery modular multiplication simplifying quotient determination, a scalar multiplication structure for elliptic curve over prime fields is proposed and implemented. The proposal uses the modified Jacobian projective coordinates to exploit the point addition and point doubling of elliptic curves, and adopts the Montgomery inverse algorithm proposed by Kaliski. Experimental results show that our structure can achieve better performance than the related work.