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
200
201
202
|
/*
* ecgen, tool for generating Elliptic curve domain parameters
* Copyright (C) 2017 J08nY
*/
#include <misc/types.h>
#include "brainpool.h"
#include "gen/seed.h"
#include "io/output.h"
#include "util/bits.h"
#include "util/str.h"
static seed_t *brainpool_new() {
seed_t *result = seed_new();
result->type = SEED_BRAINPOOL;
return result;
}
static void seed_wv(seed_t *seed) {
pari_sp ltop = avma;
GEN L = utoi(cfg->bits);
seed->brainpool.v = itou(gfloor(gdivgs(subis(L, 1), 160)));
seed->brainpool.w =
itou(subis(subis(L, 160 * seed->brainpool.v), 1));
avma = ltop;
}
static void brainpool_update_seed(bits_t *s) {
pari_sp ltop = avma;
GEN z = bits_to_i(s);
GEN t = Fp_add(z, gen_1, int2n(160));
bits_t *result = bits_from_i_len(t, 160);
avma = ltop;
bits_cpy(s, result);
bits_free(&result);
}
static bits_t *brainpool_hash(const bits_t *s, long w, long v) {
pari_sp ltop = avma;
unsigned char h[20];
bits_sha1(s, h);
unsigned char hashout[20 * v];
GEN z = bits_to_i(s);
GEN m = int2n(160);
for (long i = 1; i <= v; ++i) {
bits_t *si = bits_from_i(Fp_add(z, stoi(i), m));
bits_sha1(si, hashout + (20 * (i - 1)));
bits_free(&si);
}
bits_t *result = bits_from_raw(h, 20*8);
bits_shortenz(result, 20*8 - w);
bits_t *rest = bits_from_raw(hashout, (size_t) (20 * v * 8));
bits_concatz(result, rest, NULL);
bits_free(&rest);
avma = ltop;
return result;
}
bool brainpool_seed_valid(const char *hex_str) {
const char *seed = str_is_hex(hex_str);
return seed && strlen(seed) == 40;
}
GENERATOR(brainpool_gen_seed_random) {
seed_t *seed = brainpool_new();
seed->seed = bits_new_rand(160);
seed_wv(seed);
curve->seed = seed;
return 1;
}
GENERATOR(brainpool_gen_seed_argument) {
seed_t *seed = brainpool_new();
seed->seed = bits_from_hex(str_is_hex(cfg->seed));
seed_wv(seed);
curve->seed = seed;
return 1;
}
GENERATOR(brainpool_gen_seed_input) {
pari_sp ltop = avma;
GEN str = input_string("seed:");
const char *cstr = GSTR(str);
if (!brainpool_seed_valid(cstr)) {
fprintf(err, "SEED must be exactly 160 bits(40 hex characters).\n");
avma = ltop;
return 0;
}
seed_t *seed = brainpool_new();
seed->seed = bits_from_hex(str_is_hex(cstr));
seed_wv(seed);
curve->seed = seed;
return 1;
}
GENERATOR(brainpool_gen_field) {
pari_sp btop = avma;
seed_t *seed = curve->seed;
do {
if (seed->brainpool.update_seed) {
brainpool_update_seed(seed->seed);
seed->brainpool.update_seed = false;
}
bits_t *p_bits = brainpool_hash(seed->seed, seed->brainpool.w + 1, seed->brainpool.v);
GEN c = bits_to_i(p_bits);
bits_free(&p_bits);
GEN p = c;
do {
p = nextprime(addii(p, gen_1));
} while (mod4(p) != 3);
GEN lower_bound = subii(int2u(cfg->bits - 1), gen_1);
GEN upper_bound = int2u(cfg->bits);
if (mpcmp(p, lower_bound) <= 0 || mpcmp(p, upper_bound) >= 0) {
brainpool_update_seed(seed->seed);
avma = btop;
continue;
}
if (!isprime(p)) {
brainpool_update_seed(seed->seed);
avma = btop;
continue;
}
curve->field = p;
gerepileall(btop, 1, &curve->field);
break;
} while (true);
seed->brainpool.update_seed = true;
return 1;
}
GENERATOR(brainpool_gen_equation) {
// field is definitely prime
pari_sp btop = avma;
seed_t *seed = curve->seed;
do {
if (seed->brainpool.update_seed) {
brainpool_update_seed(seed->seed);
seed->brainpool.update_seed = false;
}
GEN z;
bits_t *a_bits =
brainpool_hash(seed->seed, seed->brainpool.w, seed->brainpool.v);
GEN a = bits_to_i(a_bits);
bits_free(&a_bits);
z = Fp_sqrtn(a, stoi(4), curve->field, NULL);
if (z == NULL) {
brainpool_update_seed(seed->seed);
avma = btop;
continue;
}
seed->brainpool.seed_a = bits_copy(seed->seed);
brainpool_update_seed(seed->seed);
bits_t *b_bits =
brainpool_hash(seed->seed, seed->brainpool.w, seed->brainpool.v);
GEN b = bits_to_i(b_bits);
bits_free(&b_bits);
if (!Fp_issquare(b, curve->field)) {
brainpool_update_seed(seed->seed);
bits_free(&seed->brainpool.seed_a);
avma = btop;
continue;
}
seed->brainpool.seed_b = bits_copy(seed->seed);
GEN mod_a = gmodulo(a, curve->field);
GEN mod_b = gmodulo(b, curve->field);
if (gequal0(gmulsg(-16, gadd(gmulsg(4, gpowgs(mod_a, 3)),
gmulsg(27, gsqr(mod_b)))))) {
brainpool_update_seed(seed->seed);
bits_free(&seed->brainpool.seed_a);
bits_free(&seed->brainpool.seed_b);
avma = btop;
continue;
}
brainpool_update_seed(seed->seed);
seed->brainpool.seed_bp = bits_copy(seed->seed);
bits_t *mult_bits =
brainpool_hash(seed->seed, seed->brainpool.w, seed->brainpool.v);
seed->brainpool.mult = bits_to_i(mult_bits);
curve->a = mod_a;
curve->b = mod_b;
gerepileall(btop, 2, &curve->a, &curve->b);
break;
} while (true);
seed->brainpool.update_seed = true;
return 1;
}
|
