17 Jan
2013
17 Jan
'13
3:19 p.m.
On 01/17/2013 08:54 PM, Nikos Mavrogiannopoulos wrote:
- For general point multiplication, I tend towards using a simple non-sliding window, with a small point-specific table computed at run time. If the table is small enough, it might make sense to normalize the entries. As far as I understand, one can't beat the plain binary algorithm by a large factor; the algorithms I'm aware of only reduce the number of adds, but not the number of dups.
btw. moving from the sliding window version (the one I submitted last year) to wmnaf, gave 7-16% performance boost in transaction/sec on ECDH/ECDSA depending on the size of the curve. So given that the sliding window method is faster than the simple, it could be quite a difference.
regards, Nikos