Date: Aug 14, 2013 11:19 AM
Author: Joe Niederberger
Subject: Re: The Arithmetic of Scalar Multiplication on Elliptic Curve Cryptography

Jonathan,

You used to recommend adding p to 0 over and over again (p added to 0, k times) -- what's changed? Is repeatedly forming the sum p+p (k-1 times) more challenging?

Cheers,