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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
/*
* ecgen, tool for generating Elliptic curve domain parameters
* Copyright (C) 2017 J08nY
*/
#include "point.h"
#include "exhaustive/arg.h"
#include "io/output.h"
#include "math/subgroups.h"
#include "util/memory.h"
point_t *point_new(void) { return try_calloc(sizeof(point_t)); }
point_t *point_copy(const point_t *src, point_t *dest) {
if (src->point) dest->point = gcopy(src->point);
if (src->order) dest->order = gcopy(src->order);
if (src->cofactor) dest->cofactor = gcopy(src->cofactor);
return dest;
}
point_t *point_new_copy(const point_t *src) {
point_t *result = point_new();
return point_copy(src, result);
}
point_t *point_clone(const point_t *src, point_t *dest) {
if (src->point) dest->point = gclone(src->point);
if (src->order) dest->order = gclone(src->order);
if (src->cofactor) dest->cofactor = gclone(src->cofactor);
return dest;
}
point_t *point_new_clone(const point_t *src) {
point_t *result = point_new();
return point_clone(src, result);
}
void point_free(point_t **point) {
if (*point) {
if ((*point)->point && isclone((*point)->point)) {
gunclone((*point)->point);
}
if ((*point)->order && isclone((*point)->order)) {
gunclone((*point)->order);
}
if ((*point)->cofactor && isclone((*point)->cofactor)) {
gunclone((*point)->cofactor);
}
try_free(*point);
*point = NULL;
}
}
point_t **points_new(size_t num) { return try_calloc(num * sizeof(point_t *)); }
point_t **points_copy(point_t **const src, point_t **dest, size_t num) {
for (size_t i = 0; i < num; ++i) {
dest[i] = point_new_copy(src[i]);
}
return dest;
}
point_t **points_new_copy(point_t **const src, size_t num) {
point_t **result = points_new(num);
return points_copy(src, result, num);
}
point_t **points_clone(point_t **const src, point_t **dest, size_t num) {
for (size_t i = 0; i < num; ++i) {
dest[i] = point_new_clone(src[i]);
}
return dest;
}
point_t **points_new_clone(point_t **const src, size_t num) {
point_t **result = points_new(num);
return points_clone(src, result, num);
}
void points_free(point_t ***points) {
if (*points) {
try_free(*points);
*points = NULL;
}
}
void points_free_deep(point_t ***points, size_t npoints) {
if (*points) {
for (size_t i = 0; i < npoints; ++i) {
point_free(&(*points)[i]);
}
points_free(points);
}
}
GENERATOR(point_gen_random) {
point_t *p = point_new();
p->point = genrand(curve->curve);
p->order = ellorder(curve->curve, p->point, NULL);
curve->points = points_new(1);
curve->points[0] = p;
curve->npoints = 1;
return 1;
}
GENERATOR(points_gen_random) {
HAS_ARG(args);
size_t npoints = *(size_t *)args->args;
curve->points = points_new(npoints);
curve->npoints = npoints;
for (size_t i = 0; i < npoints; ++i) {
point_t *p = point_new();
p->point = genrand(curve->curve);
p->order = ellorder(curve->curve, p->point, NULL);
curve->points[i] = p;
}
return 1;
}
static int points_from_orders(curve_t *curve, GEN orders) {
// TODO better stack code
size_t norders = (size_t)glength(orders);
curve->points = points_new(norders);
curve->npoints = norders;
for (size_t ngen = 0; ngen < curve->ngens; ++ngen) {
point_t *gen = curve->generators[ngen];
for (long i = 0; i < norders; ++i) {
GEN num = gel(orders, i + 1);
if (curve->points[i] == NULL) {
pari_sp ftop = avma;
GEN point = NULL;
if (equalii(gen->order, num)) {
point = gcopy(gen->point);
} else if (dvdii(gen->order, num)) {
GEN mul = divii(gen->order, num);
point = ellmul(curve->curve, gen->point, mul);
}
if (point) {
debug_log("VERIFY %Ps %Ps", num,
ellorder(curve->curve, point, NULL));
curve->points[i] = point_new();
gerepileall(ftop, 1, &point);
curve->points[i]->point = point;
curve->points[i]->order = gcopy(num);
}
}
}
}
return 1;
}
GENERATOR(points_gen_trial) {
HAS_ARG(args);
pari_ulong *primes = (pari_ulong *)args->args;
size_t nprimes = args->nargs;
GEN orders = gtovec0(gen_0, nprimes);
for (size_t i = 1; i <= nprimes; ++i) {
gel(orders, i) = utoi(primes[i - 1]);
}
return points_from_orders(curve, orders);
}
GENERATOR(points_gen_prime) {
GEN primes = subgroups_prime(curve, cfg);
return points_from_orders(curve, primes);
}
GENERATOR(points_gen_allgroups) {
GEN groups = subgroups_all(curve, cfg);
return points_from_orders(curve, groups);
}
GENERATOR(points_gen_nonprime) {
GEN groups = subgroups_nonprime(curve, cfg);
if (!groups) {
// No non-prime order points on curve.
return 1;
} else {
return points_from_orders(curve, groups);
}
}
UNROLL(points_unroll) {
if (curve->points) {
points_free_deep(&curve->points, curve->npoints);
}
return -1;
}
|
