I am using double and add method for point multiplication in affine coordinates. How we compute 1PM in double and method?
Di Wang said one point multiplication consists of repeated addition and doubling operations, so the calculated time of point multiplication
#ADD*1ADD + #DBL*1DBL
more less equals 1PM. But when I calculate with the formula show different result:
#ADD*1ADD + #DBL*1DBL = 127#ADD*2ms + 256#DBL*3ms = 766ms
Actual 1PM = 421ms.
This is a huge difference. Can anyone explain this difference?
Double and add algorithm requires log2(n) iterations of point doubling and addition to compute the full-point multiplication.
So I think that: $2^y = n$ where $y$ is number point addition or doubling
Double and Add Method d=11=(1011) Example : 11P= 2.((2.(2P))+P) + P, it consist of 3DBL + 2ADD. So 1PM less equal to #ADD*1ADD + #DBL*1DBL = 2ADDtimeof1ADD + 3DBLtimeof1ADD = time of 1PM.
If i have d lenghth = 256 bit, and i use Double-and-Method, How many #ADD and #DOUBLE iterations in there? DiWang said 127#ADD and 256#DOUBLE, can somebody explain how get this number?