Abstract:

The paper proposes a secure and efficient Montgomery ladder algorithm for elliptic curve scalar multiplication computation. The algorithm inherits secure feature of resisting side channel analysis from basic Montgomery ladder algorithm. Meanwhile, the implementation efficiency is improved by paralleling and ycoordinate recovery technique. The running time of the algorithm is ［(4M+2S)+(3M+2S)］×t+12M+S.

Key words: elliptic curve scalar multiplication, side channel attack, Montgomery ladder algorithm