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
|
/*
* ecgen, tool for generating Elliptic curve domain parameters
* Copyright (C) 2017-2018 J08nY
*/
/**
* @file point.h
*/
#ifndef ECGEN_POINT_H
#define ECGEN_POINT_H
#include "misc/types.h"
/**
*
* @return
*/
point_t *point_new(void);
/**
*
* @param src
* @param dest
* @return
*/
point_t *point_copy(const point_t *src, point_t *dest);
/**
*
* @param src
* @return
*/
point_t *point_new_copy(const point_t *src);
/**
*
* @param src
* @param dest
* @return
*/
point_t *point_clone(const point_t *src, point_t *dest);
/**
*
* @param src
* @return
*/
point_t *point_new_clone(const point_t *src);
/**
*
* @param point
*/
void point_free(point_t **point);
/**
*
* @param num
* @return
*/
point_t **points_new(size_t num);
/**
*
* @param src
* @param dest
* @param num
* @return
*/
point_t **points_copy(point_t **const src, point_t **dest, size_t num);
/**
*
* @param src
* @param num
* @return
*/
point_t **points_new_copy(point_t **const src, size_t num);
/**
*
* @param src
* @param dest
* @param num
* @return
*/
point_t **points_clone(point_t **const src, point_t **dest, size_t num);
/**
*
* @param src
* @param num
* @return
*/
point_t **points_new_clone(point_t **const src, size_t num);
/**
*
* @param point
*/
void points_free(point_t ***point);
/**
*
* @param points
* @param npoints
*/
void points_free_deep(point_t ***points, size_t npoints);
/**
* GENERATOR(gen_f)
*
* @param curve A curve_t being generated
* @param args unused
* @return state diff
*/
GENERATOR(point_gen_random);
/**
* GENERATOR(gen_f)
*
* @param curve A curve_t being generated
* @param args size_t number of points to generate
* @return state diff
*/
GENERATOR(points_gen_random);
/**
* GENERATOR(gen_f)
* Generates prime order points using trial division.
*
* Assumes the primes divide curve order, thus that points with all
* prime orders specified exist.
*
* @param curve A curve_t being generated
* @param args pari_ulong array of primes length nargs
* @return state diff
*/
GENERATOR(points_gen_trial);
/**
* GENERATOR(gen_f)
*
* Cauchy:
* Let G be a finite group and p be a prime. If p divides the order of G, then
* G has an element of order p.
*
* @param curve A curve_t being generated
* @param args unused
* @return state diff
*/
GENERATOR(points_gen_prime);
/**
* GENERATOR(gen_f)
*
* Generates points on all subgroups of the curve. Prime and non-prime order.
*
* @param curve A curve_t being generated
* @param args unused
* @return state diff
*/
GENERATOR(points_gen_allgroups);
/**
* GENERATOR(gen_f)
*
* Generates points on non-prime order of the curve.
*
* @param curve A curve_t being generated
* @param args unused
* @return state diff
*/
GENERATOR(points_gen_nonprime);
/**
* UNROLL(unroll_f)
*
* @param curve
* @param from
* @param to
* @return
*/
UNROLL(points_unroll);
#endif // ECGEN_POINT_H
|
