Résumé
The scalar multiplication is the main operation of cryptographic protocols based on elliptic curve. In the past few years, software implementations of scalar multiplication over binary elliptic curves have made some important progress. The new generations of Intel processors (Core i3,i5,7) provide a new instruction PCLMULQDQ which computes the product of 64bit binary polynomials which makes possible to speed-up the arithmetic in GF(2^m). The other improvements are due to new approaches for parallel implementation. We will review some recent results on parallel implementations based on GLV/GLS approach and on point halving.