Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains.
Nicolas Méloni · 2006
In this paper, we propose a new fast and secure point multiplication algorithm. It is based on a particular kind of addition chains involving only additions (no doubling), providing a natural protection against side channel attacks. Moreover, we propose new addition formulae that take into account the specific structure of those chains making point multiplication very e#cient.