Parallel scalar multiplication on general elliptic curves over F p hedged against Non-Differential Side-Channel Attacks.
Wieland Fischer, Christophe Giraud, Erik Woodward Knudsen, Jean‐Pierre Seifert · 2002
For speeding up elliptic curve scalar multiplication and making it secure against side-channel attacks such as timing or power analysis, various methods have been proposed using specifically chosen elliptic curves. We show that both goals can be achieved simultaneously even for conventional elliptic curves over Fp . This result is shown via two facts. First, we recall the known fact that every elliptic curve over Fp admits a scalar multiplication via a (Montgomery ladder) Lucas chain.