We discuss a parallelized version of elliptic curve
multiplication over GF(p). Comparing with some addition chains and
addition formulas, we give a faster algorithm based on Montgomery's
idea. We also discuss the resistance against side-channel attacks (SCA).
Our SCA-resistant algorithms are fast not only in parallel computation
but in non-parallel computation.