The main loop of windowed scalar multiplication involves computing 2^j P + Q. Typically this is just done with j doublings and an add. However it seems a somewhat obvious question to ask whether there are more efficient formulae that compute parts or all of this at once. For example, can 4P be computed faster than 2(2P)?
There seems to be some discussion of this in the literature.
The main loop of windowed scalar multiplication involves computing
2^j P + Q. Typically this is just done withjdoublings and an add. However it seems a somewhat obvious question to ask whether there are more efficient formulae that compute parts or all of this at once. For example, can4Pbe computed faster than2(2P)?There seems to be some discussion of this in the literature.
Related #67 #73