Securing the Elliptic Curve Montgomery Ladder against Fault Attacks
Nevine Ebeid, Rob Lambert · 2009
The Montgomery ladder method of computing elliptic curve scalar multiplication is esteemed as an efficient algorithm, inherently resistant to simple side-channel attacks as well as to various fault attacks. In FDTC 08, Fouque et al. present an attack on the Montgomery ladder in the presence of a point validation countermeasure, when the y-coordinate is not used. In this paper, we present an efficient countermeasure that renders the algorithm resistant to this attack as well as to other known fault attacks.