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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
|
#include <vector>
#include <string>
#include <fstream>
#include <iostream>
#include <cstdlib>
#include <botan/bigint.h>
#include <botan/numthry.h>
#include <botan/rng.h>
using namespace Botan;
#include "common.h"
#define DEBUG 0
u32bit check_add(const std::vector<std::string>&);
u32bit check_sub(const std::vector<std::string>&);
u32bit check_mul(const std::vector<std::string>&);
u32bit check_div(const std::vector<std::string>&);
u32bit check_mod(const std::vector<std::string>&);
u32bit check_shr(const std::vector<std::string>&);
u32bit check_shl(const std::vector<std::string>&);
u32bit check_powmod(const std::vector<std::string>&);
u32bit check_primetest(const std::vector<std::string>&);
u32bit do_bigint_tests(const std::string& filename)
{
std::ifstream test_data(filename.c_str());
if(!test_data)
{
std::cout << "Couldn't open test file " << filename << std::endl;
std::exit(1);
}
u32bit errors = 0, alg_count = 0;
std::string algorithm;
bool first = true;
u32bit counter = 0;
while(!test_data.eof())
{
if(test_data.bad() || test_data.fail())
{
std::cout << "File I/O error." << std::endl;
std::exit(1);
}
std::string line;
std::getline(test_data, line);
strip(line);
if(line.size() == 0) continue;
// Do line continuation
while(line[line.size()-1] == '\\' && !test_data.eof())
{
line.replace(line.size()-1, 1, "");
std::string nextline;
std::getline(test_data, nextline);
strip(nextline);
if(nextline.size() == 0) continue;
line += nextline;
}
if(line[0] == '[' && line[line.size() - 1] == ']')
{
algorithm = line.substr(1, line.size() - 2);
alg_count = 0;
counter = 0;
if(!first)
std::cout << std::endl;
std::cout << "Testing BigInt " << algorithm << ": ";
std::cout.flush();
first = false;
continue;
}
std::vector<std::string> substr = parse(line);
#if DEBUG
std::cout << "Testing: " << algorithm << std::endl;
#endif
u32bit new_errors = 0;
if(algorithm.find("Addition") != std::string::npos)
new_errors = check_add(substr);
else if(algorithm.find("Subtraction") != std::string::npos)
new_errors = check_sub(substr);
else if(algorithm.find("Multiplication") != std::string::npos)
new_errors = check_mul(substr);
else if(algorithm.find("Division") != std::string::npos)
new_errors = check_div(substr);
else if(algorithm.find("Modulo") != std::string::npos)
new_errors = check_mod(substr);
else if(algorithm.find("LeftShift") != std::string::npos)
new_errors = check_shl(substr);
else if(algorithm.find("RightShift") != std::string::npos)
new_errors = check_shr(substr);
else if(algorithm.find("ModExp") != std::string::npos)
new_errors = check_powmod(substr);
else if(algorithm.find("PrimeTest") != std::string::npos)
new_errors = check_primetest(substr);
else
std::cout << "Unknown MPI test " << algorithm << std::endl;
if(counter % 3 == 0)
{
std::cout << '.';
std::cout.flush();
}
counter++;
alg_count++;
errors += new_errors;
if(new_errors)
std::cout << "ERROR: BigInt " << algorithm << " failed test #"
<< std::dec << alg_count << std::endl;
}
std::cout << std::endl;
return errors;
}
// c==expected, d==a op b, e==a op= b
u32bit results(std::string op,
const BigInt& a, const BigInt& b,
const BigInt& c, const BigInt& d, const BigInt& e)
{
std::string op1 = "operator" + op;
std::string op2 = op1 + "=";
if(c == d && d == e)
return 0;
else
{
std::cout << std::endl;
std::cout << "ERROR: " << op1 << std::endl;
#if 1
std::cout << "a = " << a << std::endl;
std::cout << "b = " << b << std::endl;
std::cout << "c = " << c << std::endl;
std::cout << "d = " << d << std::endl;
std::cout << "e = " << e << std::endl;
#else
std::cout << "a = " << std::hex << a << std::endl;
std::cout << "b = " << std::hex << b << std::endl;
std::cout << "c = " << std::hex << c << std::endl;
std::cout << "d = " << std::hex << d << std::endl;
std::cout << "e = " << std::hex << e << std::endl;
#endif
if(d != e)
{
std::cout << "ERROR: " << op1 << " | " << op2
<< " mismatch" << std::endl;
}
return 1;
}
}
u32bit check_add(const std::vector<std::string>& args)
{
BigInt a(args[0]);
BigInt b(args[1]);
BigInt c(args[2]);
BigInt d = a + b;
BigInt e = a;
e += b;
if(results("+", a, b, c, d, e))
return 1;
d = b + a;
e = b;
e += a;
return results("+", a, b, c, d, e);
}
u32bit check_sub(const std::vector<std::string>& args)
{
BigInt a(args[0]);
BigInt b(args[1]);
BigInt c(args[2]);
BigInt d = a - b;
BigInt e = a;
e -= b;
return results("-", a, b, c, d, e);
}
u32bit check_mul(const std::vector<std::string>& args)
{
BigInt a(args[0]);
BigInt b(args[1]);
BigInt c(args[2]);
/*
std::cout << "a = " << args[0] << "\n"
<< "b = " << args[1] << std::endl;
*/
/* This makes it more likely the fast multiply algorithms will be usable,
which is what we really want to test here (the simple n^2 multiply is
pretty well tested at this point).
*/
a.grow_reg(32);
b.grow_reg(32);
BigInt d = a * b;
BigInt e = a;
e *= b;
if(results("*", a, b, c, d, e))
return 1;
d = b * a;
e = b;
e *= a;
return results("*", a, b, c, d, e);
}
u32bit check_div(const std::vector<std::string>& args)
{
BigInt a(args[0]);
BigInt b(args[1]);
BigInt c(args[2]);
BigInt d = a / b;
BigInt e = a;
e /= b;
return results("/", a, b, c, d, e);
}
u32bit check_mod(const std::vector<std::string>& args)
{
BigInt a(args[0]);
BigInt b(args[1]);
BigInt c(args[2]);
BigInt d = a % b;
BigInt e = a;
e %= b;
u32bit got = results("%", a, b, c, d, e);
if(got) return got;
word b_word = b.word_at(0);
/* Won't work for us, just pick one at random */
while(b_word == 0)
for(u32bit j = 0; j != 2*sizeof(word); j++)
b_word = (b_word << 4) ^ Global_RNG::random();
b = b_word;
c = a % b; /* we declare the BigInt % BigInt version to be correct here */
word d2 = a % b_word;
e = a;
e %= b_word;
return results("%(word)", a, b, c, d2, e);
}
u32bit check_shl(const std::vector<std::string>& args)
{
BigInt a(args[0]);
u32bit b = std::atoi(args[1].c_str());
BigInt c(args[2]);
BigInt d = a << b;
BigInt e = a;
e <<= b;
return results("<<", a, b, c, d, e);
}
u32bit check_shr(const std::vector<std::string>& args)
{
BigInt a(args[0]);
u32bit b = std::atoi(args[1].c_str());
BigInt c(args[2]);
BigInt d = a >> b;
BigInt e = a;
e >>= b;
return results(">>", a, b, c, d, e);
}
/* Make sure that (a^b)%m == r */
u32bit check_powmod(const std::vector<std::string>& args)
{
BigInt a(args[0]);
BigInt b(args[1]);
BigInt m(args[2]);
BigInt c(args[3]);
BigInt r = power_mod(a, b, m);
if(c != r)
{
std::cout << "ERROR: power_mod" << std::endl;
std::cout << "a = " << std::hex << a << std::endl;
std::cout << "b = " << std::hex << b << std::endl;
std::cout << "m = " << std::hex << m << std::endl;
std::cout << "c = " << std::hex << c << std::endl;
std::cout << "r = " << std::hex << r << std::endl;
return 1;
}
return 0;
}
/* Make sure that n is prime or not prime, according to should_be_prime */
u32bit check_primetest(const std::vector<std::string>& args)
{
BigInt n(args[0]);
bool should_be_prime = (args[1] == "1");
bool is_prime = Botan::verify_prime(n);
if(is_prime != should_be_prime)
{
std::cout << "ERROR: verify_prime" << std::endl;
std::cout << "n = " << n << std::endl;
std::cout << is_prime << " != " << should_be_prime << std::endl;
}
return 0;
}
|