Further refactoring of the wNAF code

The big change is that the "rows" are no longer slices of val[] but
that they actually own the points they contain. The price for this
is an extra allocation for val[] and to piece it together from the
two rows. That's ugly, but less ugly than before.

Add a helper for freeing a row of points. It can deal with a NULL
row so, we can remove a couple of complications.

The second change is that the logic for preparing the rows is pulled
back into ec_wNAF_mul[]. This way the m * G + n * P logic is in the
one function that needs to know about it, the rest just deals with
a pair of a point and a scalar.

This starts resembling actual code...

ok jsing

0 files changed, 0 insertions, 0 deletions