Abstract
We present two new strategies for parallel implementation of scalar multiplication over elliptic curves. We first introduce a Montgomery-halving algorithm which is a variation of the original Montgomery point multiplication. This Montgomery-halving can be run in parallel with the original Montgomery point multiplication in order to concurently compute part of the scalar multiplication. We also present two point thirding formulas in some subfamily of curves E(GF(3^m)). We use these thirding formulas to implement the scalar multiplication through a Third-and-add approach and a parallel Third-and-add and Double-and-add or Triple-and-add approaches. We also provide some implementation results on an Intel Core i7 of the presented two strategies which show a speed-up of 5%-13% compared to non-parallelized approaches.