Cryptography, Cybersecurity, Elliptic Curve, Ecc.
represent this as n.G. For this, Peter Montgomery created a method known as the Montgomery Ladder. The basic method is: N ← P Q ← 0 for i from 0 to m do if di = 1 then Q ← point_add(Q, N) N ← point_double(N) return Q For a=100 we have a binary value of 1100100: 1100100, thus we double the point