SPA Resistant Algorithms for Elliptic Curve Cryptography over GF(2m)

Scalar multiplication is the kernel and most time-consuming operation in elliptic curve cryptosystems. In this paper, efficient and secure scalar multiplication algorithms are proposed over binary field, where the scalar multiplication can be designed and implemented rapidly without arithmetic coprocessor. By using innovative side channel atomicity in point operation formulae, these proposed algorithms can be protected against simple power analysis, and thereby achieve higher security without loss of overall performance.