Skip to main content
. 2018 Jan 16;18(1):251. doi: 10.3390/s18010251
Algorithm 1 Montgomery ladder algorithm
Require: k, P
Ensure: kP
  1: P1←P,P2←2P
  2: for i=m−2downto0 do
  3:  if ki=0 then
  4:   P1←2P1,P2←P1+P2
  5:  else
  6:   P1←P1+P2,P2←2P1
  7:  end if
  8: end for
  9: return P1