1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
#include "mult.h"
#include "point.h"
void scalar_mult_inner(bn_t *scalar, point_t *point, curve_t *curve, point_t *out) {
{%- if scalarmult.complete %}
point_t *q = point_copy(point);
point_t *r = point_copy(curve->neutral);
int nbits = bn_bit_length(&curve->n) - 1;
{%- else %}
point_t *q = point_copy(point);
point_t *r = point_copy(point);
int nbits = bn_bit_length(scalar) - 2;
{%- endif %}
{%- if scalarmult.always %}
point_t *dummy = point_new();
{%- endif %}
for (int i = nbits; i >= 0; i--) {
point_dbl(r, curve, r);
if (bn_get_bit(scalar, i) == 1) {
point_accumulate(r, q, curve, r);
} else {
{%- if scalarmult.always %}
point_accumulate(r, q, curve, dummy);
{%- endif %}
}
}
{%- if "scl" in scalarmult.formulas %}
point_scl(r, curve, r);
{%- endif %}
point_set(r, out);
point_free(q);
point_free(r);
{%- if scalarmult.always %}
point_free(dummy);
{%- endif %}
}
|
