]>
Commit | Line | Data |
---|---|---|
440e5d80 | 1 | /* |
ad887416 | 2 | * Copyright 1995-2017 The OpenSSL Project Authors. All Rights Reserved. |
d02b48c6 | 3 | * |
440e5d80 RS |
4 | * Licensed under the OpenSSL license (the "License"). You may not use |
5 | * this file except in compliance with the License. You can obtain a copy | |
6 | * in the file LICENSE in the source distribution or at | |
7 | * https://www.openssl.org/source/license.html | |
d02b48c6 | 8 | */ |
07016a8a | 9 | #include "../e_os.h" |
8d1ebff4 RS |
10 | #include <assert.h> |
11 | #include <errno.h> | |
d02b48c6 | 12 | #include <stdio.h> |
d02b48c6 | 13 | #include <string.h> |
8d1ebff4 | 14 | #include <ctype.h> |
17e3dd1c | 15 | |
176db6dc | 16 | #include "internal/nelem.h" |
176db6dc | 17 | #include "internal/numbers.h" |
ec577822 | 18 | #include <openssl/bn.h> |
8d1ebff4 | 19 | #include <openssl/crypto.h> |
ec577822 | 20 | #include <openssl/err.h> |
8d1ebff4 RS |
21 | #include <openssl/rand.h> |
22 | #include "testutil.h" | |
d02b48c6 | 23 | |
39dbb990 RL |
24 | /* |
25 | * In bn_lcl.h, bn_expand() is defined as a static ossl_inline function. | |
26 | * This is fine in itself, it will end up as an unused static function in | |
8d1ebff4 | 27 | * the worst case. However, it references bn_expand2(), which is a private |
39dbb990 RL |
28 | * function in libcrypto and therefore unavailable on some systems. This |
29 | * may result in a linker error because of unresolved symbols. | |
30 | * | |
31 | * To avoid this, we define a dummy variant of bn_expand2() here, and to | |
32 | * avoid possible clashes with libcrypto, we rename it first, using a macro. | |
33 | */ | |
34 | #define bn_expand2 dummy_bn_expand2 | |
6f58da88 | 35 | BIGNUM *bn_expand2(BIGNUM *b, int words); |
239b84e5 | 36 | BIGNUM *bn_expand2(BIGNUM *b, int words) { return NULL; } |
8927c278 FLM |
37 | #include "../crypto/bn/bn_lcl.h" |
38 | ||
8d1ebff4 RS |
39 | /* |
40 | * Things in boring, not in openssl. TODO we should add them. | |
41 | */ | |
42 | #define HAVE_BN_PADDED 0 | |
43 | #define HAVE_BN_SQRT 0 | |
0f113f3e | 44 | |
8d1ebff4 RS |
45 | typedef struct filetest_st { |
46 | const char *name; | |
47 | int (*func)(STANZA *s); | |
48 | } FILETEST; | |
0f113f3e | 49 | |
8d1ebff4 RS |
50 | typedef struct mpitest_st { |
51 | const char *base10; | |
52 | const char *mpi; | |
53 | size_t mpi_len; | |
54 | } MPITEST; | |
0f113f3e | 55 | |
8d1ebff4 RS |
56 | static const int NUM0 = 100; /* number of tests */ |
57 | static const int NUM1 = 50; /* additional tests for some functions */ | |
8d1ebff4 | 58 | static BN_CTX *ctx; |
0f113f3e | 59 | |
30bea14b RS |
60 | /* |
61 | * Polynomial coefficients used in GFM tests. | |
62 | */ | |
ed5c7ea2 | 63 | #ifndef OPENSSL_NO_EC2M |
30bea14b RS |
64 | static int p0[] = { 163, 7, 6, 3, 0, -1 }; |
65 | static int p1[] = { 193, 15, 0, -1 }; | |
ed5c7ea2 | 66 | #endif |
0f113f3e | 67 | |
8d1ebff4 RS |
68 | /* |
69 | * Look for |key| in the stanza and return it or NULL if not found. | |
70 | */ | |
71 | static const char *findattr(STANZA *s, const char *key) | |
72 | { | |
73 | int i = s->numpairs; | |
74 | PAIR *pp = s->pairs; | |
0f113f3e | 75 | |
8d1ebff4 RS |
76 | for ( ; --i >= 0; pp++) |
77 | if (strcasecmp(pp->key, key) == 0) | |
78 | return pp->value; | |
79 | return NULL; | |
80 | } | |
0f113f3e | 81 | |
8d1ebff4 RS |
82 | /* |
83 | * Parse BIGNUM, return number of bytes parsed. | |
84 | */ | |
85 | static int parseBN(BIGNUM **out, const char *in) | |
86 | { | |
87 | *out = NULL; | |
88 | return BN_hex2bn(out, in); | |
89 | } | |
0f113f3e | 90 | |
8d1ebff4 RS |
91 | static int parsedecBN(BIGNUM **out, const char *in) |
92 | { | |
93 | *out = NULL; | |
94 | return BN_dec2bn(out, in); | |
95 | } | |
96a4c31b | 96 | |
8d1ebff4 RS |
97 | static BIGNUM *getBN(STANZA *s, const char *attribute) |
98 | { | |
99 | const char *hex; | |
100 | BIGNUM *ret = NULL; | |
8ff70f33 | 101 | |
8d1ebff4 | 102 | if ((hex = findattr(s, attribute)) == NULL) { |
ae269dd8 | 103 | TEST_error("%s:%d: Can't find %s", s->test_file, s->start, attribute); |
8d1ebff4 RS |
104 | return NULL; |
105 | } | |
0f113f3e | 106 | |
8d1ebff4 | 107 | if (parseBN(&ret, hex) != (int)strlen(hex)) { |
30bea14b | 108 | TEST_error("Could not decode '%s'", hex); |
8d1ebff4 RS |
109 | return NULL; |
110 | } | |
111 | return ret; | |
112 | } | |
0f113f3e | 113 | |
8d1ebff4 RS |
114 | static int getint(STANZA *s, int *out, const char *attribute) |
115 | { | |
30bea14b | 116 | BIGNUM *ret; |
8d1ebff4 RS |
117 | BN_ULONG word; |
118 | int st = 0; | |
0f113f3e | 119 | |
30bea14b RS |
120 | if (!TEST_ptr(ret = getBN(s, attribute)) |
121 | || !TEST_ulong_le(word = BN_get_word(ret), INT_MAX)) | |
0f113f3e | 122 | goto err; |
0f113f3e | 123 | |
8d1ebff4 RS |
124 | *out = (int)word; |
125 | st = 1; | |
126 | err: | |
127 | BN_free(ret); | |
128 | return st; | |
129 | } | |
0f113f3e | 130 | |
8d1ebff4 RS |
131 | static int equalBN(const char *op, const BIGNUM *expected, const BIGNUM *actual) |
132 | { | |
8d1ebff4 RS |
133 | if (BN_cmp(expected, actual) == 0) |
134 | return 1; | |
0f113f3e | 135 | |
dc352c19 P |
136 | TEST_error("unexpected %s value", op); |
137 | TEST_BN_eq(expected, actual); | |
8d1ebff4 | 138 | return 0; |
0f113f3e | 139 | } |
d02b48c6 | 140 | |
0f113f3e | 141 | |
8d1ebff4 RS |
142 | /* |
143 | * Return a "random" flag for if a BN should be negated. | |
144 | */ | |
145 | static int rand_neg(void) | |
146 | { | |
147 | static unsigned int neg = 0; | |
148 | static int sign[8] = { 0, 0, 0, 1, 1, 0, 1, 1 }; | |
0f113f3e | 149 | |
8d1ebff4 | 150 | return sign[(neg++) % 8]; |
0f113f3e | 151 | } |
d02b48c6 | 152 | |
8d1ebff4 | 153 | |
31a80694 | 154 | static int test_sub(void) |
0f113f3e | 155 | { |
30bea14b RS |
156 | BIGNUM *a = NULL, *b = NULL, *c = NULL; |
157 | int i, st = 0; | |
0f113f3e | 158 | |
30bea14b RS |
159 | if (!TEST_ptr(a = BN_new()) |
160 | || !TEST_ptr(b = BN_new()) | |
161 | || !TEST_ptr(c = BN_new())) | |
162 | goto err; | |
0f113f3e | 163 | |
8d1ebff4 RS |
164 | for (i = 0; i < NUM0 + NUM1; i++) { |
165 | if (i < NUM1) { | |
0f113f3e MC |
166 | BN_bntest_rand(a, 512, 0, 0); |
167 | BN_copy(b, a); | |
30bea14b RS |
168 | if (!TEST_int_ne(BN_set_bit(a, i), 0)) |
169 | goto err; | |
0f113f3e MC |
170 | BN_add_word(b, i); |
171 | } else { | |
8d1ebff4 | 172 | BN_bntest_rand(b, 400 + i - NUM1, 0, 0); |
0f113f3e MC |
173 | a->neg = rand_neg(); |
174 | b->neg = rand_neg(); | |
175 | } | |
176 | BN_sub(c, a, b); | |
0f113f3e MC |
177 | BN_add(c, c, b); |
178 | BN_sub(c, c, a); | |
dc352c19 | 179 | if (!TEST_BN_eq_zero(c)) |
30bea14b | 180 | goto err; |
0f113f3e | 181 | } |
30bea14b RS |
182 | st = 1; |
183 | err: | |
0f113f3e MC |
184 | BN_free(a); |
185 | BN_free(b); | |
186 | BN_free(c); | |
30bea14b | 187 | return st; |
0f113f3e | 188 | } |
8169dd73 | 189 | |
cf9056cf | 190 | |
31a80694 | 191 | static int test_div_recip(void) |
0f113f3e | 192 | { |
30bea14b RS |
193 | BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL, *e = NULL; |
194 | BN_RECP_CTX *recp = NULL; | |
195 | int st = 0, i; | |
0f113f3e | 196 | |
30bea14b RS |
197 | if (!TEST_ptr(a = BN_new()) |
198 | || !TEST_ptr(b = BN_new()) | |
199 | || !TEST_ptr(c = BN_new()) | |
200 | || !TEST_ptr(d = BN_new()) | |
201 | || !TEST_ptr(e = BN_new()) | |
202 | || !TEST_ptr(recp = BN_RECP_CTX_new())) | |
203 | goto err; | |
0f113f3e | 204 | |
8d1ebff4 RS |
205 | for (i = 0; i < NUM0 + NUM1; i++) { |
206 | if (i < NUM1) { | |
0f113f3e MC |
207 | BN_bntest_rand(a, 400, 0, 0); |
208 | BN_copy(b, a); | |
209 | BN_lshift(a, a, i); | |
210 | BN_add_word(a, i); | |
211 | } else | |
8d1ebff4 | 212 | BN_bntest_rand(b, 50 + 3 * (i - NUM1), 0, 0); |
0f113f3e MC |
213 | a->neg = rand_neg(); |
214 | b->neg = rand_neg(); | |
215 | BN_RECP_CTX_set(recp, b, ctx); | |
216 | BN_div_recp(d, c, a, recp, ctx); | |
0f113f3e MC |
217 | BN_mul(e, d, b, ctx); |
218 | BN_add(d, e, c); | |
219 | BN_sub(d, d, a); | |
dc352c19 | 220 | if (!TEST_BN_eq_zero(d)) |
30bea14b | 221 | goto err; |
0f113f3e | 222 | } |
30bea14b RS |
223 | st = 1; |
224 | err: | |
0f113f3e MC |
225 | BN_free(a); |
226 | BN_free(b); | |
227 | BN_free(c); | |
228 | BN_free(d); | |
229 | BN_free(e); | |
230 | BN_RECP_CTX_free(recp); | |
30bea14b | 231 | return st; |
0f113f3e | 232 | } |
d02b48c6 | 233 | |
8d1ebff4 | 234 | |
31a80694 | 235 | static int test_mod(void) |
0f113f3e | 236 | { |
30bea14b RS |
237 | BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL, *e = NULL; |
238 | int st = 0, i; | |
0f113f3e | 239 | |
30bea14b RS |
240 | if (!TEST_ptr(a = BN_new()) |
241 | || !TEST_ptr(b = BN_new()) | |
242 | || !TEST_ptr(c = BN_new()) | |
243 | || !TEST_ptr(d = BN_new()) | |
244 | || !TEST_ptr(e = BN_new())) | |
245 | goto err; | |
0f113f3e | 246 | |
8d1ebff4 RS |
247 | BN_bntest_rand(a, 1024, 0, 0); |
248 | for (i = 0; i < NUM0; i++) { | |
249 | BN_bntest_rand(b, 450 + i * 10, 0, 0); | |
0f113f3e MC |
250 | a->neg = rand_neg(); |
251 | b->neg = rand_neg(); | |
8d1ebff4 RS |
252 | BN_mod(c, a, b, ctx); |
253 | BN_div(d, e, a, b, ctx); | |
254 | BN_sub(e, e, c); | |
dc352c19 | 255 | if (!TEST_BN_eq_zero(e)) |
30bea14b | 256 | goto err; |
0f113f3e | 257 | } |
30bea14b RS |
258 | st = 1; |
259 | err: | |
0f113f3e MC |
260 | BN_free(a); |
261 | BN_free(b); | |
262 | BN_free(c); | |
263 | BN_free(d); | |
264 | BN_free(e); | |
30bea14b | 265 | return st; |
0f113f3e | 266 | } |
d02b48c6 | 267 | |
26a39fa9 RS |
268 | static const char *bn1strings[] = { |
269 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
270 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
271 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
272 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
273 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
274 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
275 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
276 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000000000FFFFFFFF00", | |
277 | "0000000000000000000000000000000000000000000000000000000000000000", | |
278 | "0000000000000000000000000000000000000000000000000000000000000000", | |
279 | "0000000000000000000000000000000000000000000000000000000000000000", | |
280 | "0000000000000000000000000000000000000000000000000000000000000000", | |
281 | "0000000000000000000000000000000000000000000000000000000000000000", | |
282 | "0000000000000000000000000000000000000000000000000000000000000000", | |
283 | "0000000000000000000000000000000000000000000000000000000000000000", | |
284 | "00000000000000000000000000000000000000000000000000FFFFFFFFFFFFFF", | |
285 | NULL | |
286 | }; | |
287 | ||
288 | static const char *bn2strings[] = { | |
289 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
290 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
291 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
292 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
293 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
294 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
295 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
296 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000000000FFFFFFFF0000000000", | |
297 | "0000000000000000000000000000000000000000000000000000000000000000", | |
298 | "0000000000000000000000000000000000000000000000000000000000000000", | |
299 | "0000000000000000000000000000000000000000000000000000000000000000", | |
300 | "0000000000000000000000000000000000000000000000000000000000000000", | |
301 | "0000000000000000000000000000000000000000000000000000000000000000", | |
302 | "0000000000000000000000000000000000000000000000000000000000000000", | |
303 | "0000000000000000000000000000000000000000000000000000000000000000", | |
304 | "000000000000000000000000000000000000000000FFFFFFFFFFFFFF00000000", | |
305 | NULL | |
306 | }; | |
307 | ||
308 | static char *glue(const char *list[]) | |
309 | { | |
310 | size_t len = 0; | |
311 | char *p, *save; | |
312 | int i; | |
313 | ||
314 | for (i = 0; list[i] != NULL; i++) | |
315 | len += strlen(list[i]); | |
30bea14b RS |
316 | if (!TEST_ptr(p = save = OPENSSL_malloc(len + 1))) |
317 | return NULL; | |
318 | for (i = 0; list[i] != NULL; i++) | |
319 | p += strlen(strcpy(p, list[i])); | |
26a39fa9 RS |
320 | return save; |
321 | } | |
322 | ||
8d1ebff4 RS |
323 | /* |
324 | * Test constant-time modular exponentiation with 1024-bit inputs, which on | |
325 | * x86_64 cause a different code branch to be taken. | |
326 | */ | |
31a80694 | 327 | static int test_modexp_mont5(void) |
0f113f3e | 328 | { |
30bea14b RS |
329 | BIGNUM *a = NULL, *p = NULL, *m = NULL, *d = NULL, *e = NULL; |
330 | BIGNUM *b = NULL, *n = NULL, *c = NULL; | |
331 | BN_MONT_CTX *mont = NULL; | |
26a39fa9 | 332 | char *bigstring; |
30bea14b | 333 | int st = 0; |
0f113f3e | 334 | |
30bea14b RS |
335 | if (!TEST_ptr(a = BN_new()) |
336 | || !TEST_ptr(p = BN_new()) | |
337 | || !TEST_ptr(m = BN_new()) | |
338 | || !TEST_ptr(d = BN_new()) | |
339 | || !TEST_ptr(e = BN_new()) | |
340 | || !TEST_ptr(b = BN_new()) | |
341 | || !TEST_ptr(n = BN_new()) | |
342 | || !TEST_ptr(c = BN_new()) | |
343 | || !TEST_ptr(mont = BN_MONT_CTX_new())) | |
344 | goto err; | |
0f113f3e | 345 | |
8d1ebff4 RS |
346 | BN_bntest_rand(m, 1024, 0, 1); /* must be odd for montgomery */ |
347 | /* Zero exponent */ | |
348 | BN_bntest_rand(a, 1024, 0, 0); | |
349 | BN_zero(p); | |
30bea14b RS |
350 | if (!TEST_true(BN_mod_exp_mont_consttime(d, a, p, m, ctx, NULL))) |
351 | goto err; | |
dc352c19 | 352 | if (!TEST_BN_eq_one(d)) |
30bea14b | 353 | goto err; |
0f113f3e | 354 | |
8d1ebff4 | 355 | /* Regression test for carry bug in mulx4x_mont */ |
0f113f3e | 356 | BN_hex2bn(&a, |
8d1ebff4 RS |
357 | "7878787878787878787878787878787878787878787878787878787878787878" |
358 | "7878787878787878787878787878787878787878787878787878787878787878" | |
359 | "7878787878787878787878787878787878787878787878787878787878787878" | |
360 | "7878787878787878787878787878787878787878787878787878787878787878"); | |
361 | BN_hex2bn(&b, | |
362 | "095D72C08C097BA488C5E439C655A192EAFB6380073D8C2664668EDDB4060744" | |
363 | "E16E57FB4EDB9AE10A0CEFCDC28A894F689A128379DB279D48A2E20849D68593" | |
364 | "9B7803BCF46CEBF5C533FB0DD35B080593DE5472E3FE5DB951B8BFF9B4CB8F03" | |
365 | "9CC638A5EE8CDD703719F8000E6A9F63BEED5F2FCD52FF293EA05A251BB4AB81"); | |
366 | BN_hex2bn(&n, | |
367 | "D78AF684E71DB0C39CFF4E64FB9DB567132CB9C50CC98009FEB820B26F2DED9B" | |
368 | "91B9B5E2B83AE0AE4EB4E0523CA726BFBE969B89FD754F674CE99118C3F2D1C5" | |
369 | "D81FDC7C54E02B60262B241D53C040E99E45826ECA37A804668E690E1AFC1CA4" | |
370 | "2C9A15D84D4954425F0B7642FC0BD9D7B24E2618D2DCC9B729D944BADACFDDAF"); | |
371 | BN_MONT_CTX_set(mont, n, ctx); | |
372 | BN_mod_mul_montgomery(c, a, b, mont, ctx); | |
373 | BN_mod_mul_montgomery(d, b, a, mont, ctx); | |
dc352c19 | 374 | if (!TEST_BN_eq(c, d)) |
30bea14b | 375 | goto err; |
0f113f3e | 376 | |
3e7a4963 | 377 | /* Regression test for carry bug in sqr[x]8x_mont */ |
26a39fa9 RS |
378 | bigstring = glue(bn1strings); |
379 | BN_hex2bn(&n, bigstring); | |
380 | OPENSSL_free(bigstring); | |
381 | bigstring = glue(bn2strings); | |
382 | BN_hex2bn(&a, bigstring); | |
383 | OPENSSL_free(bigstring); | |
384 | BN_free(b); | |
3e7a4963 AP |
385 | b = BN_dup(a); |
386 | BN_MONT_CTX_set(mont, n, ctx); | |
387 | BN_mod_mul_montgomery(c, a, a, mont, ctx); | |
388 | BN_mod_mul_montgomery(d, a, b, mont, ctx); | |
dc352c19 | 389 | if (!TEST_BN_eq(c, d)) |
30bea14b | 390 | goto err; |
3e7a4963 | 391 | |
420b88ce AP |
392 | /* Regression test for carry bug in bn_sqrx8x_internal */ |
393 | { | |
394 | static const char *ahex[] = { | |
395 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
396 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
397 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
398 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
399 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF8FFEADBCFC4DAE7FFF908E92820306B", | |
400 | "9544D954000000006C0000000000000000000000000000000000000000000000", | |
401 | "00000000000000000000FF030202FFFFF8FFEBDBCFC4DAE7FFF908E92820306B", | |
402 | "9544D954000000006C000000FF0302030000000000FFFFFFFFFFFFFFFFFFFFFF", | |
403 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF01FC00FF02FFFFFFFF", | |
404 | "00FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00FCFD", | |
405 | "FCFFFFFFFFFF000000000000000000FF0302030000000000FFFFFFFFFFFFFFFF", | |
406 | "FF00FCFDFDFF030202FF00000000FFFFFFFFFFFFFFFFFF00FCFDFCFFFFFFFFFF", | |
407 | NULL | |
408 | }; | |
409 | static const char *nhex[] = { | |
410 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
411 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
412 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
413 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
414 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF8F8F8F8000000", | |
415 | "00000010000000006C0000000000000000000000000000000000000000000000", | |
416 | "00000000000000000000000000000000000000FFFFFFFFFFFFF8F8F8F8000000", | |
417 | "00000010000000006C000000000000000000000000FFFFFFFFFFFFFFFFFFFFFF", | |
418 | "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
419 | "00FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
420 | "FFFFFFFFFFFF000000000000000000000000000000000000FFFFFFFFFFFFFFFF", | |
421 | "FFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", | |
422 | NULL | |
423 | }; | |
424 | ||
425 | bigstring = glue(ahex); | |
426 | BN_hex2bn(&a, bigstring); | |
427 | OPENSSL_free(bigstring); | |
428 | bigstring = glue(nhex); | |
429 | BN_hex2bn(&n, bigstring); | |
430 | OPENSSL_free(bigstring); | |
431 | } | |
432 | BN_free(b); | |
433 | b = BN_dup(a); | |
434 | BN_MONT_CTX_set(mont, n, ctx); | |
435 | BN_mod_mul_montgomery(c, a, a, mont, ctx); | |
436 | BN_mod_mul_montgomery(d, a, b, mont, ctx); | |
437 | if (!TEST_BN_eq(c, d)) | |
438 | goto err; | |
439 | ||
8d1ebff4 RS |
440 | /* Zero input */ |
441 | BN_bntest_rand(p, 1024, 0, 0); | |
442 | BN_zero(a); | |
30bea14b | 443 | if (!TEST_true(BN_mod_exp_mont_consttime(d, a, p, m, ctx, NULL)) |
dc352c19 | 444 | || !TEST_BN_eq_zero(d)) |
30bea14b RS |
445 | goto err; |
446 | ||
8d1ebff4 RS |
447 | /* |
448 | * Craft an input whose Montgomery representation is 1, i.e., shorter | |
449 | * than the modulus m, in order to test the const time precomputation | |
450 | * scattering/gathering. | |
451 | */ | |
452 | BN_one(a); | |
453 | BN_MONT_CTX_set(mont, m, ctx); | |
30bea14b RS |
454 | if (!TEST_true(BN_from_montgomery(e, a, mont, ctx)) |
455 | || !TEST_true(BN_mod_exp_mont_consttime(d, e, p, m, ctx, NULL)) | |
456 | || !TEST_true(BN_mod_exp_simple(a, e, p, m, ctx)) | |
dc352c19 | 457 | || !TEST_BN_eq(a, d)) |
30bea14b RS |
458 | goto err; |
459 | ||
8d1ebff4 RS |
460 | /* Finally, some regular test vectors. */ |
461 | BN_bntest_rand(e, 1024, 0, 0); | |
30bea14b RS |
462 | if (!TEST_true(BN_mod_exp_mont_consttime(d, e, p, m, ctx, NULL)) |
463 | || !TEST_true(BN_mod_exp_simple(a, e, p, m, ctx)) | |
dc352c19 | 464 | || !TEST_BN_eq(a, d)) |
30bea14b RS |
465 | goto err; |
466 | ||
467 | st = 1; | |
468 | ||
469 | err: | |
0f113f3e MC |
470 | BN_MONT_CTX_free(mont); |
471 | BN_free(a); | |
8d1ebff4 RS |
472 | BN_free(p); |
473 | BN_free(m); | |
0f113f3e | 474 | BN_free(d); |
8d1ebff4 RS |
475 | BN_free(e); |
476 | BN_free(b); | |
0f113f3e | 477 | BN_free(n); |
8d1ebff4 | 478 | BN_free(c); |
30bea14b | 479 | return st; |
0f113f3e | 480 | } |
d02b48c6 | 481 | |
8d1ebff4 | 482 | #ifndef OPENSSL_NO_EC2M |
31a80694 | 483 | static int test_gf2m_add(void) |
0f113f3e | 484 | { |
30bea14b | 485 | BIGNUM *a = NULL, *b = NULL, *c = NULL; |
8d1ebff4 | 486 | int i, st = 0; |
0f113f3e | 487 | |
30bea14b RS |
488 | if (!TEST_ptr(a = BN_new()) |
489 | || !TEST_ptr(b = BN_new()) | |
490 | || !TEST_ptr(c = BN_new())) | |
491 | goto err; | |
0f113f3e | 492 | |
8d1ebff4 RS |
493 | for (i = 0; i < NUM0; i++) { |
494 | BN_rand(a, 512, 0, 0); | |
495 | BN_copy(b, BN_value_one()); | |
0f113f3e MC |
496 | a->neg = rand_neg(); |
497 | b->neg = rand_neg(); | |
8d1ebff4 RS |
498 | BN_GF2m_add(c, a, b); |
499 | /* Test that two added values have the correct parity. */ | |
30bea14b RS |
500 | if (!TEST_false((BN_is_odd(a) && BN_is_odd(c)) |
501 | || (!BN_is_odd(a) && !BN_is_odd(c)))) | |
8d1ebff4 | 502 | goto err; |
8d1ebff4 RS |
503 | BN_GF2m_add(c, c, c); |
504 | /* Test that c + c = 0. */ | |
dc352c19 | 505 | if (!TEST_BN_eq_zero(c)) |
8d1ebff4 | 506 | goto err; |
0f113f3e | 507 | } |
8d1ebff4 RS |
508 | st = 1; |
509 | err: | |
0f113f3e MC |
510 | BN_free(a); |
511 | BN_free(b); | |
512 | BN_free(c); | |
8d1ebff4 | 513 | return st; |
0f113f3e | 514 | } |
d02b48c6 | 515 | |
31a80694 | 516 | static int test_gf2m_mod(void) |
0f113f3e | 517 | { |
30bea14b | 518 | BIGNUM *a = NULL, *b[2] = {NULL,NULL}, *c = NULL, *d = NULL, *e = NULL; |
8d1ebff4 | 519 | int i, j, st = 0; |
0f113f3e | 520 | |
30bea14b RS |
521 | if (!TEST_ptr(a = BN_new()) |
522 | || !TEST_ptr(b[0] = BN_new()) | |
523 | || !TEST_ptr(b[1] = BN_new()) | |
524 | || !TEST_ptr(c = BN_new()) | |
525 | || !TEST_ptr(d = BN_new()) | |
526 | || !TEST_ptr(e = BN_new())) | |
527 | goto err; | |
0f113f3e | 528 | |
8d1ebff4 RS |
529 | BN_GF2m_arr2poly(p0, b[0]); |
530 | BN_GF2m_arr2poly(p1, b[1]); | |
0f113f3e | 531 | |
8d1ebff4 RS |
532 | for (i = 0; i < NUM0; i++) { |
533 | BN_bntest_rand(a, 1024, 0, 0); | |
534 | for (j = 0; j < 2; j++) { | |
535 | BN_GF2m_mod(c, a, b[j]); | |
536 | BN_GF2m_add(d, a, c); | |
537 | BN_GF2m_mod(e, d, b[j]); | |
538 | /* Test that a + (a mod p) mod p == 0. */ | |
dc352c19 | 539 | if (!TEST_BN_eq_zero(e)) |
8d1ebff4 | 540 | goto err; |
0f113f3e MC |
541 | } |
542 | } | |
8d1ebff4 RS |
543 | st = 1; |
544 | err: | |
0f113f3e | 545 | BN_free(a); |
8d1ebff4 RS |
546 | BN_free(b[0]); |
547 | BN_free(b[1]); | |
0f113f3e MC |
548 | BN_free(c); |
549 | BN_free(d); | |
550 | BN_free(e); | |
8d1ebff4 | 551 | return st; |
0f113f3e | 552 | } |
d02b48c6 | 553 | |
31a80694 | 554 | static int test_gf2m_mul(void) |
0f113f3e | 555 | { |
30bea14b RS |
556 | BIGNUM *a, *b[2] = {NULL, NULL}, *c = NULL, *d = NULL; |
557 | BIGNUM *e = NULL, *f = NULL, *g = NULL, *h = NULL; | |
8d1ebff4 | 558 | int i, j, st = 0; |
30bea14b RS |
559 | |
560 | if (!TEST_ptr(a = BN_new()) | |
561 | || !TEST_ptr(b[0] = BN_new()) | |
562 | || !TEST_ptr(b[1] = BN_new()) | |
563 | || !TEST_ptr(c = BN_new()) | |
564 | || !TEST_ptr(d = BN_new()) | |
565 | || !TEST_ptr(e = BN_new()) | |
566 | || !TEST_ptr(f = BN_new()) | |
567 | || !TEST_ptr(g = BN_new()) | |
568 | || !TEST_ptr(h = BN_new())) | |
569 | goto err; | |
0f113f3e | 570 | |
8d1ebff4 RS |
571 | BN_GF2m_arr2poly(p0, b[0]); |
572 | BN_GF2m_arr2poly(p1, b[1]); | |
0f113f3e | 573 | |
8d1ebff4 RS |
574 | for (i = 0; i < NUM0; i++) { |
575 | BN_bntest_rand(a, 1024, 0, 0); | |
576 | BN_bntest_rand(c, 1024, 0, 0); | |
577 | BN_bntest_rand(d, 1024, 0, 0); | |
578 | for (j = 0; j < 2; j++) { | |
579 | BN_GF2m_mod_mul(e, a, c, b[j], ctx); | |
580 | BN_GF2m_add(f, a, d); | |
581 | BN_GF2m_mod_mul(g, f, c, b[j], ctx); | |
582 | BN_GF2m_mod_mul(h, d, c, b[j], ctx); | |
583 | BN_GF2m_add(f, e, g); | |
584 | BN_GF2m_add(f, f, h); | |
585 | /* Test that (a+d)*c = a*c + d*c. */ | |
dc352c19 | 586 | if (!TEST_BN_eq_zero(f)) |
8d1ebff4 | 587 | goto err; |
0f113f3e | 588 | } |
29851264 | 589 | } |
8d1ebff4 | 590 | st = 1; |
30bea14b | 591 | |
8d1ebff4 | 592 | err: |
0f113f3e | 593 | BN_free(a); |
8d1ebff4 RS |
594 | BN_free(b[0]); |
595 | BN_free(b[1]); | |
0f113f3e MC |
596 | BN_free(c); |
597 | BN_free(d); | |
598 | BN_free(e); | |
8d1ebff4 RS |
599 | BN_free(f); |
600 | BN_free(g); | |
601 | BN_free(h); | |
602 | return st; | |
0f113f3e | 603 | } |
d02b48c6 | 604 | |
31a80694 | 605 | static int test_gf2m_sqr(void) |
0f113f3e | 606 | { |
30bea14b | 607 | BIGNUM *a = NULL, *b[2] = {NULL,NULL}, *c = NULL, *d = NULL; |
8d1ebff4 | 608 | int i, j, st = 0; |
0f113f3e | 609 | |
30bea14b RS |
610 | if (!TEST_ptr(a = BN_new()) |
611 | || !TEST_ptr(b[0] = BN_new()) | |
612 | || !TEST_ptr(b[1] = BN_new()) | |
613 | || !TEST_ptr(c = BN_new()) | |
614 | || !TEST_ptr(d = BN_new())) | |
615 | goto err; | |
a9009e51 | 616 | |
8d1ebff4 RS |
617 | BN_GF2m_arr2poly(p0, b[0]); |
618 | BN_GF2m_arr2poly(p1, b[1]); | |
0f113f3e | 619 | |
8d1ebff4 RS |
620 | for (i = 0; i < NUM0; i++) { |
621 | BN_bntest_rand(a, 1024, 0, 0); | |
622 | for (j = 0; j < 2; j++) { | |
623 | BN_GF2m_mod_sqr(c, a, b[j], ctx); | |
624 | BN_copy(d, a); | |
625 | BN_GF2m_mod_mul(d, a, d, b[j], ctx); | |
626 | BN_GF2m_add(d, c, d); | |
627 | /* Test that a*a = a^2. */ | |
dc352c19 | 628 | if (!TEST_BN_eq_zero(d)) |
8d1ebff4 | 629 | goto err; |
0f113f3e MC |
630 | } |
631 | } | |
8d1ebff4 RS |
632 | st = 1; |
633 | err: | |
0f113f3e | 634 | BN_free(a); |
8d1ebff4 RS |
635 | BN_free(b[0]); |
636 | BN_free(b[1]); | |
0f113f3e MC |
637 | BN_free(c); |
638 | BN_free(d); | |
8d1ebff4 | 639 | return st; |
0f113f3e MC |
640 | } |
641 | ||
31a80694 | 642 | static int test_gf2m_modinv(void) |
0f113f3e | 643 | { |
30bea14b | 644 | BIGNUM *a = NULL, *b[2] = {NULL,NULL}, *c = NULL, *d = NULL; |
8d1ebff4 | 645 | int i, j, st = 0; |
0f113f3e | 646 | |
30bea14b RS |
647 | if (!TEST_ptr(a = BN_new()) |
648 | || !TEST_ptr(b[0] = BN_new()) | |
649 | || !TEST_ptr(b[1] = BN_new()) | |
650 | || !TEST_ptr(c = BN_new()) | |
651 | || !TEST_ptr(d = BN_new())) | |
652 | goto err; | |
0f113f3e MC |
653 | |
654 | BN_GF2m_arr2poly(p0, b[0]); | |
655 | BN_GF2m_arr2poly(p1, b[1]); | |
656 | ||
8d1ebff4 | 657 | for (i = 0; i < NUM0; i++) { |
0f113f3e MC |
658 | BN_bntest_rand(a, 512, 0, 0); |
659 | for (j = 0; j < 2; j++) { | |
660 | BN_GF2m_mod_inv(c, a, b[j], ctx); | |
661 | BN_GF2m_mod_mul(d, a, c, b[j], ctx); | |
0f113f3e | 662 | /* Test that ((1/a)*a) = 1. */ |
dc352c19 | 663 | if (!TEST_BN_eq_one(d)) |
0f113f3e | 664 | goto err; |
0f113f3e MC |
665 | } |
666 | } | |
8d1ebff4 | 667 | st = 1; |
0f113f3e MC |
668 | err: |
669 | BN_free(a); | |
670 | BN_free(b[0]); | |
671 | BN_free(b[1]); | |
672 | BN_free(c); | |
673 | BN_free(d); | |
8d1ebff4 | 674 | return st; |
0f113f3e MC |
675 | } |
676 | ||
31a80694 | 677 | static int test_gf2m_moddiv(void) |
0f113f3e | 678 | { |
30bea14b RS |
679 | BIGNUM *a = NULL, *b[2] = {NULL,NULL}, *c = NULL, *d = NULL; |
680 | BIGNUM *e = NULL, *f = NULL; | |
8d1ebff4 | 681 | int i, j, st = 0; |
0f113f3e | 682 | |
30bea14b RS |
683 | if (!TEST_ptr(a = BN_new()) |
684 | || !TEST_ptr(b[0] = BN_new()) | |
685 | || !TEST_ptr(b[1] = BN_new()) | |
686 | || !TEST_ptr(c = BN_new()) | |
687 | || !TEST_ptr(d = BN_new()) | |
688 | || !TEST_ptr(e = BN_new()) | |
689 | || !TEST_ptr(f = BN_new())) | |
690 | goto err; | |
0f113f3e MC |
691 | |
692 | BN_GF2m_arr2poly(p0, b[0]); | |
693 | BN_GF2m_arr2poly(p1, b[1]); | |
694 | ||
8d1ebff4 | 695 | for (i = 0; i < NUM0; i++) { |
0f113f3e MC |
696 | BN_bntest_rand(a, 512, 0, 0); |
697 | BN_bntest_rand(c, 512, 0, 0); | |
698 | for (j = 0; j < 2; j++) { | |
699 | BN_GF2m_mod_div(d, a, c, b[j], ctx); | |
700 | BN_GF2m_mod_mul(e, d, c, b[j], ctx); | |
701 | BN_GF2m_mod_div(f, a, e, b[j], ctx); | |
0f113f3e | 702 | /* Test that ((a/c)*c)/a = 1. */ |
dc352c19 | 703 | if (!TEST_BN_eq_one(f)) |
0f113f3e | 704 | goto err; |
0f113f3e MC |
705 | } |
706 | } | |
8d1ebff4 | 707 | st = 1; |
0f113f3e MC |
708 | err: |
709 | BN_free(a); | |
710 | BN_free(b[0]); | |
711 | BN_free(b[1]); | |
712 | BN_free(c); | |
713 | BN_free(d); | |
714 | BN_free(e); | |
715 | BN_free(f); | |
8d1ebff4 | 716 | return st; |
0f113f3e MC |
717 | } |
718 | ||
31a80694 | 719 | static int test_gf2m_modexp(void) |
0f113f3e | 720 | { |
30bea14b RS |
721 | BIGNUM *a = NULL, *b[2] = {NULL,NULL}, *c = NULL, *d = NULL; |
722 | BIGNUM *e = NULL, *f = NULL; | |
8d1ebff4 | 723 | int i, j, st = 0; |
0f113f3e | 724 | |
30bea14b RS |
725 | if (!TEST_ptr(a = BN_new()) |
726 | || !TEST_ptr(b[0] = BN_new()) | |
727 | || !TEST_ptr(b[1] = BN_new()) | |
728 | || !TEST_ptr(c = BN_new()) | |
729 | || !TEST_ptr(d = BN_new()) | |
730 | || !TEST_ptr(e = BN_new()) | |
731 | || !TEST_ptr(f = BN_new())) | |
732 | goto err; | |
0f113f3e MC |
733 | |
734 | BN_GF2m_arr2poly(p0, b[0]); | |
735 | BN_GF2m_arr2poly(p1, b[1]); | |
736 | ||
8d1ebff4 | 737 | for (i = 0; i < NUM0; i++) { |
0f113f3e MC |
738 | BN_bntest_rand(a, 512, 0, 0); |
739 | BN_bntest_rand(c, 512, 0, 0); | |
740 | BN_bntest_rand(d, 512, 0, 0); | |
741 | for (j = 0; j < 2; j++) { | |
742 | BN_GF2m_mod_exp(e, a, c, b[j], ctx); | |
743 | BN_GF2m_mod_exp(f, a, d, b[j], ctx); | |
744 | BN_GF2m_mod_mul(e, e, f, b[j], ctx); | |
745 | BN_add(f, c, d); | |
746 | BN_GF2m_mod_exp(f, a, f, b[j], ctx); | |
0f113f3e MC |
747 | BN_GF2m_add(f, e, f); |
748 | /* Test that a^(c+d)=a^c*a^d. */ | |
dc352c19 | 749 | if (!TEST_BN_eq_zero(f)) |
0f113f3e | 750 | goto err; |
0f113f3e MC |
751 | } |
752 | } | |
8d1ebff4 | 753 | st = 1; |
0f113f3e MC |
754 | err: |
755 | BN_free(a); | |
756 | BN_free(b[0]); | |
757 | BN_free(b[1]); | |
758 | BN_free(c); | |
759 | BN_free(d); | |
760 | BN_free(e); | |
761 | BN_free(f); | |
8d1ebff4 | 762 | return st; |
0f113f3e MC |
763 | } |
764 | ||
31a80694 | 765 | static int test_gf2m_modsqrt(void) |
0f113f3e | 766 | { |
30bea14b RS |
767 | BIGNUM *a = NULL, *b[2] = {NULL,NULL}, *c = NULL, *d = NULL; |
768 | BIGNUM *e = NULL, *f = NULL; | |
8d1ebff4 | 769 | int i, j, st = 0; |
0f113f3e | 770 | |
30bea14b RS |
771 | if (!TEST_ptr(a = BN_new()) |
772 | || !TEST_ptr(b[0] = BN_new()) | |
773 | || !TEST_ptr(b[1] = BN_new()) | |
774 | || !TEST_ptr(c = BN_new()) | |
775 | || !TEST_ptr(d = BN_new()) | |
776 | || !TEST_ptr(e = BN_new()) | |
777 | || !TEST_ptr(f = BN_new())) | |
778 | goto err; | |
0f113f3e MC |
779 | |
780 | BN_GF2m_arr2poly(p0, b[0]); | |
781 | BN_GF2m_arr2poly(p1, b[1]); | |
782 | ||
8d1ebff4 | 783 | for (i = 0; i < NUM0; i++) { |
0f113f3e MC |
784 | BN_bntest_rand(a, 512, 0, 0); |
785 | for (j = 0; j < 2; j++) { | |
786 | BN_GF2m_mod(c, a, b[j]); | |
787 | BN_GF2m_mod_sqrt(d, a, b[j], ctx); | |
788 | BN_GF2m_mod_sqr(e, d, b[j], ctx); | |
0f113f3e MC |
789 | BN_GF2m_add(f, c, e); |
790 | /* Test that d^2 = a, where d = sqrt(a). */ | |
dc352c19 | 791 | if (!TEST_BN_eq_zero(f)) |
0f113f3e | 792 | goto err; |
0f113f3e MC |
793 | } |
794 | } | |
8d1ebff4 | 795 | st = 1; |
0f113f3e MC |
796 | err: |
797 | BN_free(a); | |
798 | BN_free(b[0]); | |
799 | BN_free(b[1]); | |
800 | BN_free(c); | |
801 | BN_free(d); | |
802 | BN_free(e); | |
803 | BN_free(f); | |
8d1ebff4 | 804 | return st; |
0f113f3e MC |
805 | } |
806 | ||
31a80694 | 807 | static int test_gf2m_modsolvequad(void) |
0f113f3e | 808 | { |
30bea14b RS |
809 | BIGNUM *a = NULL, *b[2] = {NULL,NULL}, *c = NULL, *d = NULL; |
810 | BIGNUM *e = NULL; | |
8d1ebff4 | 811 | int i, j, s = 0, t, st = 0; |
0f113f3e | 812 | |
30bea14b RS |
813 | if (!TEST_ptr(a = BN_new()) |
814 | || !TEST_ptr(b[0] = BN_new()) | |
815 | || !TEST_ptr(b[1] = BN_new()) | |
816 | || !TEST_ptr(c = BN_new()) | |
817 | || !TEST_ptr(d = BN_new()) | |
818 | || !TEST_ptr(e = BN_new())) | |
819 | goto err; | |
0f113f3e MC |
820 | |
821 | BN_GF2m_arr2poly(p0, b[0]); | |
822 | BN_GF2m_arr2poly(p1, b[1]); | |
823 | ||
8d1ebff4 | 824 | for (i = 0; i < NUM0; i++) { |
0f113f3e MC |
825 | BN_bntest_rand(a, 512, 0, 0); |
826 | for (j = 0; j < 2; j++) { | |
827 | t = BN_GF2m_mod_solve_quad(c, a, b[j], ctx); | |
828 | if (t) { | |
829 | s++; | |
830 | BN_GF2m_mod_sqr(d, c, b[j], ctx); | |
831 | BN_GF2m_add(d, c, d); | |
832 | BN_GF2m_mod(e, a, b[j]); | |
0f113f3e MC |
833 | BN_GF2m_add(e, e, d); |
834 | /* | |
835 | * Test that solution of quadratic c satisfies c^2 + c = a. | |
836 | */ | |
dc352c19 | 837 | if (!TEST_BN_eq_zero(e)) |
0f113f3e | 838 | goto err; |
0f113f3e MC |
839 | } |
840 | } | |
841 | } | |
30bea14b RS |
842 | if (!TEST_int_ge(s, 0)) { |
843 | TEST_info("%d tests found no roots; probably an error", NUM0); | |
0f113f3e MC |
844 | goto err; |
845 | } | |
8d1ebff4 | 846 | st = 1; |
0f113f3e MC |
847 | err: |
848 | BN_free(a); | |
849 | BN_free(b[0]); | |
850 | BN_free(b[1]); | |
851 | BN_free(c); | |
852 | BN_free(d); | |
853 | BN_free(e); | |
8d1ebff4 | 854 | return st; |
0f113f3e | 855 | } |
b3310161 | 856 | #endif |
8d1ebff4 | 857 | |
31a80694 | 858 | static int test_kronecker(void) |
0f113f3e | 859 | { |
30bea14b RS |
860 | BIGNUM *a = NULL, *b = NULL, *r = NULL, *t = NULL; |
861 | int i, legendre, kronecker, st = 0; | |
8d1ebff4 | 862 | |
30bea14b RS |
863 | if (!TEST_ptr(a = BN_new()) |
864 | || !TEST_ptr(b = BN_new()) | |
865 | || !TEST_ptr(r = BN_new()) | |
866 | || !TEST_ptr(t = BN_new())) | |
8d1ebff4 RS |
867 | goto err; |
868 | ||
869 | /* | |
870 | * We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol). In | |
871 | * this case we know that if b is prime, then BN_kronecker(a, b, ctx) is | |
872 | * congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol). So we | |
873 | * generate a random prime b and compare these values for a number of | |
874 | * random a's. (That is, we run the Solovay-Strassen primality test to | |
875 | * confirm that b is prime, except that we don't want to test whether b | |
876 | * is prime but whether BN_kronecker works.) | |
877 | */ | |
878 | ||
30bea14b | 879 | if (!TEST_true(BN_generate_prime_ex(b, 512, 0, NULL, NULL, NULL))) |
8d1ebff4 RS |
880 | goto err; |
881 | b->neg = rand_neg(); | |
882 | ||
883 | for (i = 0; i < NUM0; i++) { | |
30bea14b | 884 | if (!TEST_true(BN_bntest_rand(a, 512, 0, 0))) |
8d1ebff4 RS |
885 | goto err; |
886 | a->neg = rand_neg(); | |
887 | ||
888 | /* t := (|b|-1)/2 (note that b is odd) */ | |
30bea14b | 889 | if (!TEST_true(BN_copy(t, b))) |
8d1ebff4 RS |
890 | goto err; |
891 | t->neg = 0; | |
30bea14b | 892 | if (!TEST_true(BN_sub_word(t, 1))) |
8d1ebff4 | 893 | goto err; |
30bea14b | 894 | if (!TEST_true(BN_rshift1(t, t))) |
8d1ebff4 RS |
895 | goto err; |
896 | /* r := a^t mod b */ | |
897 | b->neg = 0; | |
898 | ||
30bea14b | 899 | if (!TEST_true(BN_mod_exp_recp(r, a, t, b, ctx))) |
8d1ebff4 RS |
900 | goto err; |
901 | b->neg = 1; | |
902 | ||
903 | if (BN_is_word(r, 1)) | |
904 | legendre = 1; | |
905 | else if (BN_is_zero(r)) | |
906 | legendre = 0; | |
907 | else { | |
30bea14b | 908 | if (!TEST_true(BN_add_word(r, 1))) |
8d1ebff4 | 909 | goto err; |
30bea14b RS |
910 | if (!TEST_int_eq(BN_ucmp(r, b), 0)) { |
911 | TEST_info("Legendre symbol computation failed"); | |
8d1ebff4 RS |
912 | goto err; |
913 | } | |
914 | legendre = -1; | |
915 | } | |
916 | ||
30bea14b | 917 | if (!TEST_int_ge(kronecker = BN_kronecker(a, b, ctx), -1)) |
8d1ebff4 RS |
918 | goto err; |
919 | /* we actually need BN_kronecker(a, |b|) */ | |
920 | if (a->neg && b->neg) | |
921 | kronecker = -kronecker; | |
922 | ||
30bea14b | 923 | if (!TEST_int_eq(legendre, kronecker)) |
8d1ebff4 | 924 | goto err; |
8d1ebff4 RS |
925 | } |
926 | ||
927 | st = 1; | |
928 | err: | |
929 | BN_free(a); | |
930 | BN_free(b); | |
931 | BN_free(r); | |
932 | BN_free(t); | |
933 | return st; | |
934 | } | |
935 | ||
936 | static int file_sum(STANZA *s) | |
937 | { | |
30bea14b | 938 | BIGNUM *a = NULL, *b = NULL, *sum = NULL, *ret = NULL; |
8d1ebff4 RS |
939 | BN_ULONG b_word; |
940 | int st = 0; | |
941 | ||
30bea14b RS |
942 | if (!TEST_ptr(a = getBN(s, "A")) |
943 | || !TEST_ptr(b = getBN(s, "B")) | |
944 | || !TEST_ptr(sum = getBN(s, "Sum")) | |
945 | || !TEST_ptr(ret = BN_new())) | |
8d1ebff4 RS |
946 | goto err; |
947 | ||
30bea14b | 948 | if (!TEST_true(BN_add(ret, a, b)) |
8d1ebff4 | 949 | || !equalBN("A + B", sum, ret) |
30bea14b | 950 | || !TEST_true(BN_sub(ret, sum, a)) |
8d1ebff4 | 951 | || !equalBN("Sum - A", b, ret) |
30bea14b | 952 | || !TEST_true(BN_sub(ret, sum, b)) |
8d1ebff4 RS |
953 | || !equalBN("Sum - B", a, ret)) |
954 | goto err; | |
955 | ||
956 | /* | |
957 | * Test that the functions work when |r| and |a| point to the same BIGNUM, | |
958 | * or when |r| and |b| point to the same BIGNUM. | |
959 | * TODO: Test where all of |r|, |a|, and |b| point to the same BIGNUM. | |
960 | */ | |
30bea14b RS |
961 | if (!TEST_true(BN_copy(ret, a)) |
962 | || !TEST_true(BN_add(ret, ret, b)) | |
8d1ebff4 | 963 | || !equalBN("A + B (r is a)", sum, ret) |
30bea14b RS |
964 | || !TEST_true(BN_copy(ret, b)) |
965 | || !TEST_true(BN_add(ret, a, ret)) | |
8d1ebff4 | 966 | || !equalBN("A + B (r is b)", sum, ret) |
30bea14b RS |
967 | || !TEST_true(BN_copy(ret, sum)) |
968 | || !TEST_true(BN_sub(ret, ret, a)) | |
8d1ebff4 | 969 | || !equalBN("Sum - A (r is a)", b, ret) |
30bea14b RS |
970 | || !TEST_true(BN_copy(ret, a)) |
971 | || !TEST_true(BN_sub(ret, sum, ret)) | |
8d1ebff4 | 972 | || !equalBN("Sum - A (r is b)", b, ret) |
30bea14b RS |
973 | || !TEST_true(BN_copy(ret, sum)) |
974 | || !TEST_true(BN_sub(ret, ret, b)) | |
8d1ebff4 | 975 | || !equalBN("Sum - B (r is a)", a, ret) |
30bea14b RS |
976 | || !TEST_true(BN_copy(ret, b)) |
977 | || !TEST_true(BN_sub(ret, sum, ret)) | |
8d1ebff4 RS |
978 | || !equalBN("Sum - B (r is b)", a, ret)) |
979 | goto err; | |
980 | ||
981 | /* | |
982 | * Test BN_uadd() and BN_usub() with the prerequisites they are | |
983 | * documented as having. Note that these functions are frequently used | |
984 | * when the prerequisites don't hold. In those cases, they are supposed | |
985 | * to work as if the prerequisite hold, but we don't test that yet. | |
986 | * TODO: test that. | |
987 | */ | |
988 | if (!BN_is_negative(a) && !BN_is_negative(b) && BN_cmp(a, b) >= 0) { | |
30bea14b | 989 | if (!TEST_true(BN_uadd(ret, a, b)) |
8d1ebff4 | 990 | || !equalBN("A +u B", sum, ret) |
30bea14b | 991 | || !TEST_true(BN_usub(ret, sum, a)) |
8d1ebff4 | 992 | || !equalBN("Sum -u A", b, ret) |
30bea14b | 993 | || !TEST_true(BN_usub(ret, sum, b)) |
8d1ebff4 RS |
994 | || !equalBN("Sum -u B", a, ret)) |
995 | goto err; | |
996 | /* | |
997 | * Test that the functions work when |r| and |a| point to the same | |
998 | * BIGNUM, or when |r| and |b| point to the same BIGNUM. | |
999 | * TODO: Test where all of |r|, |a|, and |b| point to the same BIGNUM. | |
1000 | */ | |
30bea14b RS |
1001 | if (!TEST_true(BN_copy(ret, a)) |
1002 | || !TEST_true(BN_uadd(ret, ret, b)) | |
8d1ebff4 | 1003 | || !equalBN("A +u B (r is a)", sum, ret) |
30bea14b RS |
1004 | || !TEST_true(BN_copy(ret, b)) |
1005 | || !TEST_true(BN_uadd(ret, a, ret)) | |
8d1ebff4 | 1006 | || !equalBN("A +u B (r is b)", sum, ret) |
30bea14b RS |
1007 | || !TEST_true(BN_copy(ret, sum)) |
1008 | || !TEST_true(BN_usub(ret, ret, a)) | |
8d1ebff4 | 1009 | || !equalBN("Sum -u A (r is a)", b, ret) |
30bea14b RS |
1010 | || !TEST_true(BN_copy(ret, a)) |
1011 | || !TEST_true(BN_usub(ret, sum, ret)) | |
8d1ebff4 | 1012 | || !equalBN("Sum -u A (r is b)", b, ret) |
30bea14b RS |
1013 | || !TEST_true(BN_copy(ret, sum)) |
1014 | || !TEST_true(BN_usub(ret, ret, b)) | |
8d1ebff4 | 1015 | || !equalBN("Sum -u B (r is a)", a, ret) |
30bea14b RS |
1016 | || !TEST_true(BN_copy(ret, b)) |
1017 | || !TEST_true(BN_usub(ret, sum, ret)) | |
8d1ebff4 RS |
1018 | || !equalBN("Sum -u B (r is b)", a, ret)) |
1019 | goto err; | |
1020 | } | |
1021 | ||
1022 | /* | |
1023 | * Test with BN_add_word() and BN_sub_word() if |b| is small enough. | |
1024 | */ | |
1025 | b_word = BN_get_word(b); | |
1026 | if (!BN_is_negative(b) && b_word != (BN_ULONG)-1) { | |
30bea14b RS |
1027 | if (!TEST_true(BN_copy(ret, a)) |
1028 | || !TEST_true(BN_add_word(ret, b_word)) | |
8d1ebff4 | 1029 | || !equalBN("A + B (word)", sum, ret) |
30bea14b RS |
1030 | || !TEST_true(BN_copy(ret, sum)) |
1031 | || !TEST_true(BN_sub_word(ret, b_word)) | |
8d1ebff4 RS |
1032 | || !equalBN("Sum - B (word)", a, ret)) |
1033 | goto err; | |
1034 | } | |
1035 | st = 1; | |
1036 | ||
1037 | err: | |
1038 | BN_free(a); | |
1039 | BN_free(b); | |
1040 | BN_free(sum); | |
1041 | BN_free(ret); | |
1042 | return st; | |
1043 | } | |
1044 | ||
1045 | static int file_lshift1(STANZA *s) | |
1046 | { | |
30bea14b RS |
1047 | BIGNUM *a = NULL, *lshift1 = NULL, *zero = NULL, *ret = NULL; |
1048 | BIGNUM *two = NULL, *remainder = NULL; | |
8d1ebff4 RS |
1049 | int st = 0; |
1050 | ||
30bea14b RS |
1051 | if (!TEST_ptr(a = getBN(s, "A")) |
1052 | || !TEST_ptr(lshift1 = getBN(s, "LShift1")) | |
1053 | || !TEST_ptr(zero = BN_new()) | |
1054 | || !TEST_ptr(ret = BN_new()) | |
1055 | || !TEST_ptr(two = BN_new()) | |
1056 | || !TEST_ptr(remainder = BN_new())) | |
8d1ebff4 RS |
1057 | goto err; |
1058 | ||
1059 | BN_zero(zero); | |
1060 | ||
30bea14b RS |
1061 | if (!TEST_true(BN_set_word(two, 2)) |
1062 | || !TEST_true(BN_add(ret, a, a)) | |
8d1ebff4 | 1063 | || !equalBN("A + A", lshift1, ret) |
30bea14b | 1064 | || !TEST_true(BN_mul(ret, a, two, ctx)) |
8d1ebff4 | 1065 | || !equalBN("A * 2", lshift1, ret) |
30bea14b | 1066 | || !TEST_true(BN_div(ret, remainder, lshift1, two, ctx)) |
8d1ebff4 RS |
1067 | || !equalBN("LShift1 / 2", a, ret) |
1068 | || !equalBN("LShift1 % 2", zero, remainder) | |
30bea14b | 1069 | || !TEST_true(BN_lshift1(ret, a)) |
8d1ebff4 | 1070 | || !equalBN("A << 1", lshift1, ret) |
30bea14b | 1071 | || !TEST_true(BN_rshift1(ret, lshift1)) |
8d1ebff4 | 1072 | || !equalBN("LShift >> 1", a, ret) |
30bea14b | 1073 | || !TEST_true(BN_rshift1(ret, lshift1)) |
8d1ebff4 RS |
1074 | || !equalBN("LShift >> 1", a, ret)) |
1075 | goto err; | |
1076 | ||
1077 | /* Set the LSB to 1 and test rshift1 again. */ | |
30bea14b RS |
1078 | if (!TEST_true(BN_set_bit(lshift1, 0)) |
1079 | || !TEST_true(BN_div(ret, NULL /* rem */ , lshift1, two, ctx)) | |
8d1ebff4 | 1080 | || !equalBN("(LShift1 | 1) / 2", a, ret) |
30bea14b | 1081 | || !TEST_true(BN_rshift1(ret, lshift1)) |
8d1ebff4 RS |
1082 | || !equalBN("(LShift | 1) >> 1", a, ret)) |
1083 | goto err; | |
1084 | ||
1085 | st = 1; | |
1086 | err: | |
1087 | BN_free(a); | |
1088 | BN_free(lshift1); | |
1089 | BN_free(zero); | |
1090 | BN_free(ret); | |
1091 | BN_free(two); | |
1092 | BN_free(remainder); | |
1093 | ||
1094 | return st; | |
1095 | } | |
1096 | ||
1097 | static int file_lshift(STANZA *s) | |
1098 | { | |
30bea14b RS |
1099 | BIGNUM *a = NULL, *lshift = NULL, *ret = NULL; |
1100 | int n = 0, st = 0; | |
8d1ebff4 | 1101 | |
30bea14b RS |
1102 | if (!TEST_ptr(a = getBN(s, "A")) |
1103 | || !TEST_ptr(lshift = getBN(s, "LShift")) | |
1104 | || !TEST_ptr(ret = BN_new())) | |
8d1ebff4 | 1105 | |
30bea14b | 1106 | if (!TEST_true(BN_lshift(ret, a, n)) |
8d1ebff4 | 1107 | || !equalBN("A << N", lshift, ret) |
30bea14b | 1108 | || !TEST_true(BN_rshift(ret, lshift, n)) |
8d1ebff4 RS |
1109 | || !equalBN("A >> N", a, ret)) |
1110 | goto err; | |
1111 | ||
1112 | st = 1; | |
1113 | err: | |
1114 | BN_free(a); | |
1115 | BN_free(lshift); | |
1116 | BN_free(ret); | |
1117 | return st; | |
1118 | } | |
1119 | ||
1120 | static int file_rshift(STANZA *s) | |
1121 | { | |
30bea14b RS |
1122 | BIGNUM *a = NULL, *rshift = NULL, *ret = NULL; |
1123 | int n = 0, st = 0; | |
8d1ebff4 | 1124 | |
30bea14b RS |
1125 | if (!TEST_ptr(a = getBN(s, "A")) |
1126 | || !TEST_ptr(rshift = getBN(s, "RShift")) | |
1127 | || !TEST_ptr(ret = BN_new()) | |
1128 | || !getint(s, &n, "N")) | |
8d1ebff4 RS |
1129 | goto err; |
1130 | ||
30bea14b | 1131 | if (!TEST_true(BN_rshift(ret, a, n)) |
8d1ebff4 | 1132 | || !equalBN("A >> N", rshift, ret)) |
30bea14b | 1133 | goto err; |
ceac1975 RL |
1134 | |
1135 | /* If N == 1, try with rshift1 as well */ | |
1136 | if (n == 1) { | |
30bea14b | 1137 | if (!TEST_true(BN_rshift1(ret, a)) |
ceac1975 | 1138 | || !equalBN("A >> 1 (rshift1)", rshift, ret)) |
30bea14b | 1139 | goto err; |
ceac1975 | 1140 | } |
30bea14b | 1141 | st = 1; |
8d1ebff4 | 1142 | |
8d1ebff4 RS |
1143 | err: |
1144 | BN_free(a); | |
1145 | BN_free(rshift); | |
1146 | BN_free(ret); | |
30bea14b | 1147 | return st; |
8d1ebff4 RS |
1148 | } |
1149 | ||
1150 | static int file_square(STANZA *s) | |
1151 | { | |
30bea14b RS |
1152 | BIGNUM *a = NULL, *square = NULL, *zero = NULL, *ret = NULL; |
1153 | BIGNUM *remainder = NULL, *tmp = NULL; | |
8d1ebff4 RS |
1154 | int st = 0; |
1155 | ||
30bea14b RS |
1156 | if (!TEST_ptr(a = getBN(s, "A")) |
1157 | || !TEST_ptr(square = getBN(s, "Square")) | |
1158 | || !TEST_ptr(zero = BN_new()) | |
1159 | || !TEST_ptr(ret = BN_new()) | |
1160 | || !TEST_ptr(remainder = BN_new())) | |
8d1ebff4 RS |
1161 | goto err; |
1162 | ||
1163 | BN_zero(zero); | |
30bea14b | 1164 | if (!TEST_true(BN_sqr(ret, a, ctx)) |
8d1ebff4 | 1165 | || !equalBN("A^2", square, ret) |
30bea14b | 1166 | || !TEST_true(BN_mul(ret, a, a, ctx)) |
8d1ebff4 | 1167 | || !equalBN("A * A", square, ret) |
30bea14b | 1168 | || !TEST_true(BN_div(ret, remainder, square, a, ctx)) |
8d1ebff4 RS |
1169 | || !equalBN("Square / A", a, ret) |
1170 | || !equalBN("Square % A", zero, remainder)) | |
1171 | goto err; | |
1172 | ||
1173 | #if HAVE_BN_SQRT | |
1174 | BN_set_negative(a, 0); | |
30bea14b | 1175 | if (!TEST_true(BN_sqrt(ret, square, ctx)) |
8d1ebff4 RS |
1176 | || !equalBN("sqrt(Square)", a, ret)) |
1177 | goto err; | |
1178 | ||
1179 | /* BN_sqrt should fail on non-squares and negative numbers. */ | |
dc352c19 P |
1180 | if (!TEST_BN_eq_zero(square)) { |
1181 | if (!TEST_ptr(tmp = BN_new()) | |
1182 | || !TEST_true(BN_copy(tmp, square))) | |
8d1ebff4 RS |
1183 | goto err; |
1184 | BN_set_negative(tmp, 1); | |
1185 | ||
30bea14b | 1186 | if (!TEST_int_eq(BN_sqrt(ret, tmp, ctx), 0)) |
8d1ebff4 | 1187 | goto err; |
8d1ebff4 RS |
1188 | ERR_clear_error(); |
1189 | ||
1190 | BN_set_negative(tmp, 0); | |
1191 | if (BN_add(tmp, tmp, BN_value_one())) | |
1192 | goto err; | |
30bea14b | 1193 | if (!TEST_int_eq(BN_sqrt(ret, tmp, ctx))) |
8d1ebff4 | 1194 | goto err; |
8d1ebff4 RS |
1195 | ERR_clear_error(); |
1196 | } | |
1197 | #endif | |
1198 | ||
1199 | st = 1; | |
1200 | err: | |
1201 | BN_free(a); | |
1202 | BN_free(square); | |
1203 | BN_free(zero); | |
1204 | BN_free(ret); | |
1205 | BN_free(remainder); | |
1206 | BN_free(tmp); | |
1207 | return st; | |
1208 | } | |
1209 | ||
1210 | static int file_product(STANZA *s) | |
1211 | { | |
30bea14b RS |
1212 | BIGNUM *a = NULL, *b = NULL, *product = NULL, *ret = NULL; |
1213 | BIGNUM *remainder = NULL, *zero = NULL; | |
8d1ebff4 RS |
1214 | int st = 0; |
1215 | ||
30bea14b RS |
1216 | if (!TEST_ptr(a = getBN(s, "A")) |
1217 | || !TEST_ptr(b = getBN(s, "B")) | |
1218 | || !TEST_ptr(product = getBN(s, "Product")) | |
1219 | || !TEST_ptr(ret = BN_new()) | |
1220 | || !TEST_ptr(remainder = BN_new()) | |
1221 | || !TEST_ptr(zero = BN_new())) | |
8d1ebff4 RS |
1222 | goto err; |
1223 | ||
1224 | BN_zero(zero); | |
1225 | ||
30bea14b | 1226 | if (!TEST_true(BN_mul(ret, a, b, ctx)) |
8d1ebff4 | 1227 | || !equalBN("A * B", product, ret) |
30bea14b | 1228 | || !TEST_true(BN_div(ret, remainder, product, a, ctx)) |
8d1ebff4 RS |
1229 | || !equalBN("Product / A", b, ret) |
1230 | || !equalBN("Product % A", zero, remainder) | |
30bea14b | 1231 | || !TEST_true(BN_div(ret, remainder, product, b, ctx)) |
8d1ebff4 RS |
1232 | || !equalBN("Product / B", a, ret) |
1233 | || !equalBN("Product % B", zero, remainder)) | |
1234 | goto err; | |
1235 | ||
1236 | st = 1; | |
1237 | err: | |
1238 | BN_free(a); | |
1239 | BN_free(b); | |
1240 | BN_free(product); | |
1241 | BN_free(ret); | |
1242 | BN_free(remainder); | |
1243 | BN_free(zero); | |
1244 | return st; | |
1245 | } | |
1246 | ||
1247 | static int file_quotient(STANZA *s) | |
1248 | { | |
30bea14b RS |
1249 | BIGNUM *a = NULL, *b = NULL, *quotient = NULL, *remainder = NULL; |
1250 | BIGNUM *ret = NULL, *ret2 = NULL, *nnmod = NULL; | |
8d1ebff4 RS |
1251 | BN_ULONG b_word, ret_word; |
1252 | int st = 0; | |
1253 | ||
30bea14b RS |
1254 | if (!TEST_ptr(a = getBN(s, "A")) |
1255 | || !TEST_ptr(b = getBN(s, "B")) | |
1256 | || !TEST_ptr(quotient = getBN(s, "Quotient")) | |
1257 | || !TEST_ptr(remainder = getBN(s, "Remainder")) | |
1258 | || !TEST_ptr(ret = BN_new()) | |
1259 | || !TEST_ptr(ret2 = BN_new()) | |
1260 | || !TEST_ptr(nnmod = BN_new())) | |
8d1ebff4 RS |
1261 | goto err; |
1262 | ||
30bea14b | 1263 | if (!TEST_true(BN_div(ret, ret2, a, b, ctx)) |
8d1ebff4 RS |
1264 | || !equalBN("A / B", quotient, ret) |
1265 | || !equalBN("A % B", remainder, ret2) | |
30bea14b RS |
1266 | || !TEST_true(BN_mul(ret, quotient, b, ctx)) |
1267 | || !TEST_true(BN_add(ret, ret, remainder)) | |
8d1ebff4 RS |
1268 | || !equalBN("Quotient * B + Remainder", a, ret)) |
1269 | goto err; | |
1270 | ||
1271 | /* | |
1272 | * Test with BN_mod_word() and BN_div_word() if the divisor is | |
1273 | * small enough. | |
1274 | */ | |
1275 | b_word = BN_get_word(b); | |
1276 | if (!BN_is_negative(b) && b_word != (BN_ULONG)-1) { | |
1277 | BN_ULONG remainder_word = BN_get_word(remainder); | |
1278 | ||
1279 | assert(remainder_word != (BN_ULONG)-1); | |
30bea14b | 1280 | if (!TEST_ptr(BN_copy(ret, a))) |
8d1ebff4 RS |
1281 | goto err; |
1282 | ret_word = BN_div_word(ret, b_word); | |
1283 | if (ret_word != remainder_word) { | |
1284 | #ifdef BN_DEC_FMT1 | |
30bea14b RS |
1285 | TEST_error( |
1286 | "Got A %% B (word) = " BN_DEC_FMT1 ", wanted " BN_DEC_FMT1, | |
8d1ebff4 RS |
1287 | ret_word, remainder_word); |
1288 | #else | |
30bea14b | 1289 | TEST_error("Got A %% B (word) mismatch"); |
8d1ebff4 RS |
1290 | #endif |
1291 | goto err; | |
1292 | } | |
1293 | if (!equalBN ("A / B (word)", quotient, ret)) | |
1294 | goto err; | |
1295 | ||
1296 | ret_word = BN_mod_word(a, b_word); | |
1297 | if (ret_word != remainder_word) { | |
1298 | #ifdef BN_DEC_FMT1 | |
30bea14b RS |
1299 | TEST_error( |
1300 | "Got A %% B (word) = " BN_DEC_FMT1 ", wanted " BN_DEC_FMT1 "", | |
8d1ebff4 RS |
1301 | ret_word, remainder_word); |
1302 | #else | |
30bea14b | 1303 | TEST_error("Got A %% B (word) mismatch"); |
8d1ebff4 RS |
1304 | #endif |
1305 | goto err; | |
1306 | } | |
1307 | } | |
1308 | ||
1309 | /* Test BN_nnmod. */ | |
1310 | if (!BN_is_negative(b)) { | |
30bea14b RS |
1311 | if (!TEST_true(BN_copy(nnmod, remainder)) |
1312 | || (BN_is_negative(nnmod) | |
1313 | && !TEST_true(BN_add(nnmod, nnmod, b))) | |
1314 | || !TEST_true(BN_nnmod(ret, a, b, ctx)) | |
8d1ebff4 RS |
1315 | || !equalBN("A % B (non-negative)", nnmod, ret)) |
1316 | goto err; | |
1317 | } | |
1318 | ||
1319 | st = 1; | |
1320 | err: | |
1321 | BN_free(a); | |
1322 | BN_free(b); | |
1323 | BN_free(quotient); | |
1324 | BN_free(remainder); | |
1325 | BN_free(ret); | |
1326 | BN_free(ret2); | |
1327 | BN_free(nnmod); | |
1328 | return st; | |
1329 | } | |
1330 | ||
1331 | static int file_modmul(STANZA *s) | |
1332 | { | |
30bea14b | 1333 | BIGNUM *a = NULL, *b = NULL, *m = NULL, *mod_mul = NULL, *ret = NULL; |
8d1ebff4 RS |
1334 | int st = 0; |
1335 | ||
30bea14b RS |
1336 | if (!TEST_ptr(a = getBN(s, "A")) |
1337 | || !TEST_ptr(b = getBN(s, "B")) | |
1338 | || !TEST_ptr(m = getBN(s, "M")) | |
1339 | || !TEST_ptr(mod_mul = getBN(s, "ModMul")) | |
1340 | || !TEST_ptr(ret = BN_new())) | |
8d1ebff4 RS |
1341 | goto err; |
1342 | ||
30bea14b | 1343 | if (!TEST_true(BN_mod_mul(ret, a, b, m, ctx)) |
8d1ebff4 RS |
1344 | || !equalBN("A * B (mod M)", mod_mul, ret)) |
1345 | goto err; | |
1346 | ||
1347 | if (BN_is_odd(m)) { | |
1348 | /* Reduce |a| and |b| and test the Montgomery version. */ | |
1349 | BN_MONT_CTX *mont = BN_MONT_CTX_new(); | |
1350 | BIGNUM *a_tmp = BN_new(); | |
1351 | BIGNUM *b_tmp = BN_new(); | |
30bea14b | 1352 | |
8d1ebff4 | 1353 | if (mont == NULL || a_tmp == NULL || b_tmp == NULL |
30bea14b RS |
1354 | || !TEST_true(BN_MONT_CTX_set(mont, m, ctx)) |
1355 | || !TEST_true(BN_nnmod(a_tmp, a, m, ctx)) | |
1356 | || !TEST_true(BN_nnmod(b_tmp, b, m, ctx)) | |
1357 | || !TEST_true(BN_to_montgomery(a_tmp, a_tmp, mont, ctx)) | |
1358 | || !TEST_true(BN_to_montgomery(b_tmp, b_tmp, mont, ctx)) | |
1359 | || !TEST_true(BN_mod_mul_montgomery(ret, a_tmp, b_tmp, | |
1360 | mont, ctx)) | |
1361 | || !TEST_true(BN_from_montgomery(ret, ret, mont, ctx)) | |
1362 | || !equalBN("A * B (mod M) (mont)", mod_mul, ret)) | |
8d1ebff4 | 1363 | st = 0; |
30bea14b | 1364 | else |
8d1ebff4 | 1365 | st = 1; |
8d1ebff4 RS |
1366 | BN_MONT_CTX_free(mont); |
1367 | BN_free(a_tmp); | |
1368 | BN_free(b_tmp); | |
1369 | if (st == 0) | |
1370 | goto err; | |
1371 | } | |
1372 | ||
1373 | st = 1; | |
1374 | err: | |
1375 | BN_free(a); | |
1376 | BN_free(b); | |
1377 | BN_free(m); | |
1378 | BN_free(mod_mul); | |
1379 | BN_free(ret); | |
1380 | return st; | |
1381 | } | |
1382 | ||
1383 | static int file_modexp(STANZA *s) | |
1384 | { | |
30bea14b RS |
1385 | BIGNUM *a = NULL, *e = NULL, *m = NULL, *mod_exp = NULL, *ret = NULL; |
1386 | BIGNUM *b = NULL, *c = NULL, *d = NULL; | |
8d1ebff4 RS |
1387 | int st = 0; |
1388 | ||
30bea14b RS |
1389 | if (!TEST_ptr(a = getBN(s, "A")) |
1390 | || !TEST_ptr(e = getBN(s, "E")) | |
1391 | || !TEST_ptr(m = getBN(s, "M")) | |
1392 | || !TEST_ptr(mod_exp = getBN(s, "ModExp")) | |
1393 | || !TEST_ptr(ret = BN_new()) | |
1394 | || !TEST_ptr(d = BN_new())) | |
8d1ebff4 RS |
1395 | goto err; |
1396 | ||
30bea14b | 1397 | if (!TEST_true(BN_mod_exp(ret, a, e, m, ctx)) |
8d1ebff4 RS |
1398 | || !equalBN("A ^ E (mod M)", mod_exp, ret)) |
1399 | goto err; | |
1400 | ||
1401 | if (BN_is_odd(m)) { | |
30bea14b | 1402 | if (!TEST_true(BN_mod_exp_mont(ret, a, e, m, ctx, NULL)) |
8d1ebff4 | 1403 | || !equalBN("A ^ E (mod M) (mont)", mod_exp, ret) |
30bea14b RS |
1404 | || !TEST_true(BN_mod_exp_mont_consttime(ret, a, e, m, |
1405 | ctx, NULL)) | |
8d1ebff4 RS |
1406 | || !equalBN("A ^ E (mod M) (mont const", mod_exp, ret)) |
1407 | goto err; | |
1408 | } | |
1409 | ||
1410 | /* Regression test for carry propagation bug in sqr8x_reduction */ | |
1411 | BN_hex2bn(&a, "050505050505"); | |
1412 | BN_hex2bn(&b, "02"); | |
1413 | BN_hex2bn(&c, | |
1414 | "4141414141414141414141274141414141414141414141414141414141414141" | |
1415 | "4141414141414141414141414141414141414141414141414141414141414141" | |
1416 | "4141414141414141414141800000000000000000000000000000000000000000" | |
1417 | "0000000000000000000000000000000000000000000000000000000000000000" | |
1418 | "0000000000000000000000000000000000000000000000000000000000000000" | |
1419 | "0000000000000000000000000000000000000000000000000000000001"); | |
9e206ce5 P |
1420 | if (!TEST_true(BN_mod_exp(d, a, b, c, ctx)) |
1421 | || !TEST_true(BN_mul(e, a, a, ctx)) | |
1422 | || !TEST_BN_eq(d, e)) | |
8d1ebff4 | 1423 | goto err; |
8d1ebff4 RS |
1424 | |
1425 | st = 1; | |
1426 | err: | |
1427 | BN_free(a); | |
1428 | BN_free(b); | |
1429 | BN_free(c); | |
1430 | BN_free(d); | |
1431 | BN_free(e); | |
1432 | BN_free(m); | |
1433 | BN_free(mod_exp); | |
1434 | BN_free(ret); | |
1435 | return st; | |
1436 | } | |
1437 | ||
1438 | static int file_exp(STANZA *s) | |
1439 | { | |
30bea14b | 1440 | BIGNUM *a = NULL, *e = NULL, *exp = NULL, *ret = NULL; |
8d1ebff4 RS |
1441 | int st = 0; |
1442 | ||
30bea14b RS |
1443 | if (!TEST_ptr(a = getBN(s, "A")) |
1444 | || !TEST_ptr(e = getBN(s, "E")) | |
1445 | || !TEST_ptr(exp = getBN(s, "Exp")) | |
1446 | || !TEST_ptr(ret = BN_new())) | |
8d1ebff4 RS |
1447 | goto err; |
1448 | ||
30bea14b | 1449 | if (!TEST_true(BN_exp(ret, a, e, ctx)) |
8d1ebff4 RS |
1450 | || !equalBN("A ^ E", exp, ret)) |
1451 | goto err; | |
1452 | ||
1453 | st = 1; | |
1454 | err: | |
1455 | BN_free(a); | |
1456 | BN_free(e); | |
1457 | BN_free(exp); | |
1458 | BN_free(ret); | |
1459 | return st; | |
1460 | } | |
1461 | ||
1462 | static int file_modsqrt(STANZA *s) | |
1463 | { | |
30bea14b | 1464 | BIGNUM *a = NULL, *p = NULL, *mod_sqrt = NULL, *ret = NULL, *ret2 = NULL; |
8d1ebff4 RS |
1465 | int st = 0; |
1466 | ||
30bea14b RS |
1467 | if (!TEST_ptr(a = getBN(s, "A")) |
1468 | || !TEST_ptr(p = getBN(s, "P")) | |
1469 | || !TEST_ptr(mod_sqrt = getBN(s, "ModSqrt")) | |
1470 | || !TEST_ptr(ret = BN_new()) | |
1471 | || !TEST_ptr(ret2 = BN_new())) | |
8d1ebff4 RS |
1472 | goto err; |
1473 | ||
1474 | /* There are two possible answers. */ | |
30bea14b RS |
1475 | if (!TEST_true(BN_mod_sqrt(ret, a, p, ctx)) |
1476 | || !TEST_true(BN_sub(ret2, p, ret))) | |
8d1ebff4 RS |
1477 | goto err; |
1478 | ||
30bea14b | 1479 | /* The first condition should NOT be a test. */ |
8d1ebff4 RS |
1480 | if (BN_cmp(ret2, mod_sqrt) != 0 |
1481 | && !equalBN("sqrt(A) (mod P)", mod_sqrt, ret)) | |
1482 | goto err; | |
1483 | ||
1484 | st = 1; | |
1485 | err: | |
1486 | BN_free(a); | |
1487 | BN_free(p); | |
1488 | BN_free(mod_sqrt); | |
1489 | BN_free(ret); | |
1490 | BN_free(ret2); | |
1491 | return st; | |
1492 | } | |
1493 | ||
31a80694 | 1494 | static int test_bn2padded(void) |
8d1ebff4 RS |
1495 | { |
1496 | #if HAVE_BN_PADDED | |
1497 | uint8_t zeros[256], out[256], reference[128]; | |
1498 | BIGNUM *n = BN_new(); | |
1499 | int st = 0; | |
1500 | ||
1501 | /* Test edge case at 0. */ | |
1502 | if (n == NULL) | |
1503 | goto err; | |
30bea14b | 1504 | if (!TEST_true(BN_bn2bin_padded(NULL, 0, n))) |
8d1ebff4 | 1505 | goto err; |
8d1ebff4 | 1506 | memset(out, -1, sizeof(out)); |
30bea14b | 1507 | if (!TEST_true(BN_bn2bin_padded(out, sizeof(out)), n)) |
8d1ebff4 | 1508 | goto err; |
8d1ebff4 | 1509 | memset(zeros, 0, sizeof(zeros)); |
30bea14b | 1510 | if (!TEST_mem_eq(zeros, sizeof(zeros), out, sizeof(out))) |
8d1ebff4 | 1511 | goto err; |
8d1ebff4 RS |
1512 | |
1513 | /* Test a random numbers at various byte lengths. */ | |
1514 | for (size_t bytes = 128 - 7; bytes <= 128; bytes++) { | |
1515 | #define TOP_BIT_ON 0 | |
1516 | #define BOTTOM_BIT_NOTOUCH 0 | |
30bea14b | 1517 | if (!TEST_true(BN_rand(n, bytes * 8, TOP_BIT_ON, BOTTOM_BIT_NOTOUCH))) |
8d1ebff4 | 1518 | goto err; |
30bea14b RS |
1519 | if (!TEST_int_eq(BN_num_bytes(n),A) bytes |
1520 | || TEST_int_eq(BN_bn2bin(n, reference), bytes)) | |
8d1ebff4 | 1521 | goto err; |
8d1ebff4 | 1522 | /* Empty buffer should fail. */ |
30bea14b | 1523 | if (!TEST_int_eq(BN_bn2bin_padded(NULL, 0, n)), 0) |
8d1ebff4 | 1524 | goto err; |
8d1ebff4 | 1525 | /* One byte short should fail. */ |
30bea14b | 1526 | if (BN_bn2bin_padded(out, bytes - 1, n)) |
8d1ebff4 | 1527 | goto err; |
8d1ebff4 | 1528 | /* Exactly right size should encode. */ |
30bea14b RS |
1529 | if (!TEST_true(BN_bn2bin_padded(out, bytes, n)) |
1530 | || TEST_mem_eq(out, bytes, reference, bytes)) | |
8d1ebff4 | 1531 | goto err; |
8d1ebff4 | 1532 | /* Pad up one byte extra. */ |
30bea14b RS |
1533 | if (!TEST_true(BN_bn2bin_padded(out, bytes + 1, n)) |
1534 | || !TEST_mem_eq(out + 1, bytes, reference, bytes) | |
1535 | || !TEST_mem_eq(out, 1, zeros, 1)) | |
8d1ebff4 | 1536 | goto err; |
8d1ebff4 | 1537 | /* Pad up to 256. */ |
30bea14b RS |
1538 | if (!TEST_true(BN_bn2bin_padded(out, sizeof(out)), n) |
1539 | || !TEST_mem_eq(out + sizeof(out) - bytes, bytes, | |
1540 | reference, bytes) | |
1541 | || !TEST_mem_eq(out, sizseof(out) - bytes, | |
1542 | zeros, sizeof(out) - bytes)) | |
8d1ebff4 | 1543 | goto err; |
8d1ebff4 RS |
1544 | } |
1545 | ||
1546 | st = 1; | |
1547 | err: | |
1548 | BN_free(n); | |
1549 | return st; | |
1550 | #else | |
1551 | return ctx != NULL; | |
1552 | #endif | |
1553 | } | |
1554 | ||
31a80694 | 1555 | static int test_dec2bn(void) |
8d1ebff4 RS |
1556 | { |
1557 | BIGNUM *bn = NULL; | |
1558 | int st = 0; | |
1559 | ||
30bea14b | 1560 | if (!TEST_int_eq(parsedecBN(&bn, "0"), 1) |
dc352c19 P |
1561 | || !TEST_BN_eq_word(bn, 0) |
1562 | || !TEST_BN_eq_zero(bn) | |
1563 | || !TEST_BN_le_zero(bn) | |
1564 | || !TEST_BN_ge_zero(bn) | |
1565 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1566 | goto err; |
8d1ebff4 | 1567 | BN_free(bn); |
dc352c19 | 1568 | bn = NULL; |
8d1ebff4 | 1569 | |
30bea14b | 1570 | if (!TEST_int_eq(parsedecBN(&bn, "256"), 3) |
dc352c19 P |
1571 | || !TEST_BN_eq_word(bn, 256) |
1572 | || !TEST_BN_ge_zero(bn) | |
1573 | || !TEST_BN_gt_zero(bn) | |
1574 | || !TEST_BN_ne_zero(bn) | |
1575 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1576 | goto err; |
8d1ebff4 | 1577 | BN_free(bn); |
dc352c19 | 1578 | bn = NULL; |
8d1ebff4 | 1579 | |
30bea14b | 1580 | if (!TEST_int_eq(parsedecBN(&bn, "-42"), 3) |
dc352c19 P |
1581 | || !TEST_BN_abs_eq_word(bn, 42) |
1582 | || !TEST_BN_lt_zero(bn) | |
1583 | || !TEST_BN_le_zero(bn) | |
1584 | || !TEST_BN_ne_zero(bn) | |
1585 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1586 | goto err; |
8d1ebff4 | 1587 | BN_free(bn); |
dc352c19 P |
1588 | bn = NULL; |
1589 | ||
1590 | if (!TEST_int_eq(parsedecBN(&bn, "1"), 1) | |
1591 | || !TEST_BN_eq_word(bn, 1) | |
1592 | || !TEST_BN_ne_zero(bn) | |
1593 | || !TEST_BN_gt_zero(bn) | |
1594 | || !TEST_BN_ge_zero(bn) | |
1595 | || !TEST_BN_eq_one(bn) | |
1596 | || !TEST_BN_odd(bn)) | |
1597 | goto err; | |
1598 | BN_free(bn); | |
1599 | bn = NULL; | |
8d1ebff4 | 1600 | |
30bea14b | 1601 | if (!TEST_int_eq(parsedecBN(&bn, "-0"), 2) |
dc352c19 P |
1602 | || !TEST_BN_eq_zero(bn) |
1603 | || !TEST_BN_ge_zero(bn) | |
1604 | || !TEST_BN_le_zero(bn) | |
1605 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1606 | goto err; |
8d1ebff4 | 1607 | BN_free(bn); |
dc352c19 | 1608 | bn = NULL; |
8d1ebff4 | 1609 | |
30bea14b | 1610 | if (!TEST_int_eq(parsedecBN(&bn, "42trailing garbage is ignored"), 2) |
dc352c19 P |
1611 | || !TEST_BN_abs_eq_word(bn, 42) |
1612 | || !TEST_BN_ge_zero(bn) | |
1613 | || !TEST_BN_gt_zero(bn) | |
1614 | || !TEST_BN_ne_zero(bn) | |
1615 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1616 | goto err; |
8d1ebff4 RS |
1617 | |
1618 | st = 1; | |
1619 | err: | |
1620 | BN_free(bn); | |
1621 | return st; | |
1622 | } | |
1623 | ||
31a80694 | 1624 | static int test_hex2bn(void) |
8d1ebff4 RS |
1625 | { |
1626 | BIGNUM *bn = NULL; | |
30bea14b | 1627 | int st = 0; |
8d1ebff4 | 1628 | |
30bea14b | 1629 | if (!TEST_int_eq(parseBN(&bn, "0"), 1) |
dc352c19 P |
1630 | || !TEST_BN_eq_zero(bn) |
1631 | || !TEST_BN_ge_zero(bn) | |
1632 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1633 | goto err; |
8d1ebff4 | 1634 | BN_free(bn); |
dc352c19 | 1635 | bn = NULL; |
8d1ebff4 | 1636 | |
30bea14b | 1637 | if (!TEST_int_eq(parseBN(&bn, "256"), 3) |
dc352c19 P |
1638 | || !TEST_BN_eq_word(bn, 0x256) |
1639 | || !TEST_BN_ge_zero(bn) | |
1640 | || !TEST_BN_gt_zero(bn) | |
1641 | || !TEST_BN_ne_zero(bn) | |
1642 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1643 | goto err; |
8d1ebff4 | 1644 | BN_free(bn); |
dc352c19 | 1645 | bn = NULL; |
8d1ebff4 | 1646 | |
30bea14b | 1647 | if (!TEST_int_eq(parseBN(&bn, "-42"), 3) |
dc352c19 P |
1648 | || !TEST_BN_abs_eq_word(bn, 0x42) |
1649 | || !TEST_BN_lt_zero(bn) | |
1650 | || !TEST_BN_le_zero(bn) | |
1651 | || !TEST_BN_ne_zero(bn) | |
1652 | || !TEST_BN_even(bn)) | |
1653 | goto err; | |
1654 | BN_free(bn); | |
1655 | bn = NULL; | |
1656 | ||
1657 | if (!TEST_int_eq(parseBN(&bn, "cb"), 2) | |
1658 | || !TEST_BN_eq_word(bn, 0xCB) | |
1659 | || !TEST_BN_ge_zero(bn) | |
1660 | || !TEST_BN_gt_zero(bn) | |
1661 | || !TEST_BN_ne_zero(bn) | |
1662 | || !TEST_BN_odd(bn)) | |
8d1ebff4 | 1663 | goto err; |
8d1ebff4 | 1664 | BN_free(bn); |
dc352c19 | 1665 | bn = NULL; |
8d1ebff4 | 1666 | |
30bea14b | 1667 | if (!TEST_int_eq(parseBN(&bn, "-0"), 2) |
dc352c19 P |
1668 | || !TEST_BN_eq_zero(bn) |
1669 | || !TEST_BN_ge_zero(bn) | |
1670 | || !TEST_BN_le_zero(bn) | |
1671 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1672 | goto err; |
8d1ebff4 | 1673 | BN_free(bn); |
dc352c19 | 1674 | bn = NULL; |
8d1ebff4 | 1675 | |
30bea14b | 1676 | if (!TEST_int_eq(parseBN(&bn, "abctrailing garbage is ignored"), 3) |
dc352c19 P |
1677 | || !TEST_BN_eq_word(bn, 0xabc) |
1678 | || !TEST_BN_ge_zero(bn) | |
1679 | || !TEST_BN_gt_zero(bn) | |
1680 | || !TEST_BN_ne_zero(bn) | |
1681 | || !TEST_BN_even(bn)) | |
8d1ebff4 | 1682 | goto err; |
8d1ebff4 RS |
1683 | st = 1; |
1684 | ||
1685 | err: | |
1686 | BN_free(bn); | |
1687 | return st; | |
1688 | } | |
1689 | ||
31a80694 | 1690 | static int test_asc2bn(void) |
8d1ebff4 | 1691 | { |
30bea14b | 1692 | BIGNUM *bn = NULL; |
8d1ebff4 RS |
1693 | int st = 0; |
1694 | ||
30bea14b | 1695 | if (!TEST_ptr(bn = BN_new())) |
8d1ebff4 | 1696 | goto err; |
8d1ebff4 | 1697 | |
30bea14b | 1698 | if (!TEST_true(BN_asc2bn(&bn, "0")) |
dc352c19 P |
1699 | || !TEST_BN_eq_zero(bn) |
1700 | || !TEST_BN_ge_zero(bn)) | |
8d1ebff4 | 1701 | goto err; |
8d1ebff4 | 1702 | |
30bea14b | 1703 | if (!TEST_true(BN_asc2bn(&bn, "256")) |
dc352c19 P |
1704 | || !TEST_BN_eq_word(bn, 256) |
1705 | || !TEST_BN_ge_zero(bn)) | |
8d1ebff4 | 1706 | goto err; |
8d1ebff4 | 1707 | |
30bea14b | 1708 | if (!TEST_true(BN_asc2bn(&bn, "-42")) |
dc352c19 P |
1709 | || !TEST_BN_abs_eq_word(bn, 42) |
1710 | || !TEST_BN_lt_zero(bn)) | |
8d1ebff4 | 1711 | goto err; |
8d1ebff4 | 1712 | |
30bea14b | 1713 | if (!TEST_true(BN_asc2bn(&bn, "0x1234")) |
dc352c19 P |
1714 | || !TEST_BN_eq_word(bn, 0x1234) |
1715 | || !TEST_BN_ge_zero(bn)) | |
8d1ebff4 | 1716 | goto err; |
8d1ebff4 | 1717 | |
30bea14b | 1718 | if (!TEST_true(BN_asc2bn(&bn, "0X1234")) |
dc352c19 P |
1719 | || !TEST_BN_eq_word(bn, 0x1234) |
1720 | || !TEST_BN_ge_zero(bn)) | |
8d1ebff4 | 1721 | goto err; |
8d1ebff4 | 1722 | |
30bea14b | 1723 | if (!TEST_true(BN_asc2bn(&bn, "-0xabcd")) |
dc352c19 P |
1724 | || !TEST_BN_abs_eq_word(bn, 0xabcd) |
1725 | || !TEST_BN_lt_zero(bn)) | |
8d1ebff4 | 1726 | goto err; |
8d1ebff4 | 1727 | |
30bea14b | 1728 | if (!TEST_true(BN_asc2bn(&bn, "-0")) |
dc352c19 P |
1729 | || !TEST_BN_eq_zero(bn) |
1730 | || !TEST_BN_ge_zero(bn)) | |
30bea14b RS |
1731 | goto err; |
1732 | ||
1733 | if (!TEST_true(BN_asc2bn(&bn, "123trailing garbage is ignored")) | |
dc352c19 P |
1734 | || !TEST_BN_eq_word(bn, 123) |
1735 | || !TEST_BN_ge_zero(bn)) | |
8d1ebff4 | 1736 | goto err; |
8d1ebff4 RS |
1737 | |
1738 | st = 1; | |
1739 | err: | |
1740 | BN_free(bn); | |
1741 | return st; | |
1742 | } | |
1743 | ||
1744 | static const MPITEST kMPITests[] = { | |
1745 | {"0", "\x00\x00\x00\x00", 4}, | |
1746 | {"1", "\x00\x00\x00\x01\x01", 5}, | |
1747 | {"-1", "\x00\x00\x00\x01\x81", 5}, | |
1748 | {"128", "\x00\x00\x00\x02\x00\x80", 6}, | |
1749 | {"256", "\x00\x00\x00\x02\x01\x00", 6}, | |
1750 | {"-256", "\x00\x00\x00\x02\x81\x00", 6}, | |
1751 | }; | |
1752 | ||
30bea14b | 1753 | static int test_mpi(int i) |
8d1ebff4 RS |
1754 | { |
1755 | uint8_t scratch[8]; | |
30bea14b | 1756 | const MPITEST *test = &kMPITests[i]; |
8d1ebff4 | 1757 | size_t mpi_len, mpi_len2; |
30bea14b | 1758 | BIGNUM *bn = NULL; |
8d1ebff4 RS |
1759 | BIGNUM *bn2 = NULL; |
1760 | int st = 0; | |
1761 | ||
30bea14b RS |
1762 | if (!TEST_ptr(bn = BN_new()) |
1763 | || !TEST_true(BN_asc2bn(&bn, test->base10))) | |
1764 | goto err; | |
1765 | mpi_len = BN_bn2mpi(bn, NULL); | |
1766 | if (!TEST_size_t_le(mpi_len, sizeof(scratch))) | |
1767 | goto err; | |
8d1ebff4 | 1768 | |
30bea14b RS |
1769 | if (!TEST_size_t_eq(mpi_len2 = BN_bn2mpi(bn, scratch), mpi_len) |
1770 | || !TEST_mem_eq(test->mpi, test->mpi_len, scratch, mpi_len)) | |
1771 | goto err; | |
8d1ebff4 | 1772 | |
30bea14b RS |
1773 | if (!TEST_ptr(bn2 = BN_mpi2bn(scratch, mpi_len, NULL))) |
1774 | goto err; | |
8d1ebff4 | 1775 | |
dc352c19 | 1776 | if (!TEST_BN_eq(bn, bn2)) { |
8d1ebff4 | 1777 | BN_free(bn2); |
30bea14b | 1778 | goto err; |
8d1ebff4 | 1779 | } |
30bea14b | 1780 | BN_free(bn2); |
8d1ebff4 RS |
1781 | |
1782 | st = 1; | |
1783 | err: | |
1784 | BN_free(bn); | |
1785 | return st; | |
0f113f3e | 1786 | } |
bdec3c53 | 1787 | |
31a80694 | 1788 | static int test_rand(void) |
0f113f3e | 1789 | { |
30bea14b | 1790 | BIGNUM *bn = NULL; |
8d1ebff4 | 1791 | int st = 0; |
0f113f3e | 1792 | |
30bea14b | 1793 | if (!TEST_ptr(bn = BN_new())) |
8d1ebff4 | 1794 | return 0; |
0f113f3e | 1795 | |
30bea14b RS |
1796 | /* Test BN_rand for degenerate cases with |top| and |bottom| parameters. */ |
1797 | if (!TEST_false(BN_rand(bn, 0, 0 /* top */ , 0 /* bottom */ )) | |
1798 | || !TEST_false(BN_rand(bn, 0, 1 /* top */ , 1 /* bottom */ )) | |
1799 | || !TEST_true(BN_rand(bn, 1, 0 /* top */ , 0 /* bottom */ )) | |
dc352c19 | 1800 | || !TEST_BN_eq_one(bn) |
30bea14b RS |
1801 | || !TEST_false(BN_rand(bn, 1, 1 /* top */ , 0 /* bottom */ )) |
1802 | || !TEST_true(BN_rand(bn, 1, -1 /* top */ , 1 /* bottom */ )) | |
dc352c19 | 1803 | || !TEST_BN_eq_one(bn) |
30bea14b | 1804 | || !TEST_true(BN_rand(bn, 2, 1 /* top */ , 0 /* bottom */ )) |
dc352c19 | 1805 | || !TEST_BN_eq_word(bn, 3)) |
8d1ebff4 | 1806 | goto err; |
0f113f3e | 1807 | |
8d1ebff4 RS |
1808 | st = 1; |
1809 | err: | |
1810 | BN_free(bn); | |
1811 | return st; | |
1812 | } | |
1813 | ||
31a80694 | 1814 | static int test_negzero(void) |
8d1ebff4 | 1815 | { |
30bea14b | 1816 | BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL; |
8d1ebff4 RS |
1817 | BIGNUM *numerator = NULL, *denominator = NULL; |
1818 | int consttime, st = 0; | |
1819 | ||
30bea14b RS |
1820 | if (!TEST_ptr(a = BN_new()) |
1821 | || !TEST_ptr(b = BN_new()) | |
1822 | || !TEST_ptr(c = BN_new()) | |
1823 | || !TEST_ptr(d = BN_new())) | |
8d1ebff4 RS |
1824 | goto err; |
1825 | ||
1826 | /* Test that BN_mul never gives negative zero. */ | |
30bea14b | 1827 | if (!TEST_true(BN_set_word(a, 1))) |
8d1ebff4 RS |
1828 | goto err; |
1829 | BN_set_negative(a, 1); | |
1830 | BN_zero(b); | |
30bea14b | 1831 | if (!TEST_true(BN_mul(c, a, b, ctx))) |
8d1ebff4 | 1832 | goto err; |
dc352c19 P |
1833 | if (!TEST_BN_eq_zero(c) |
1834 | || !TEST_BN_ge_zero(c)) | |
8d1ebff4 | 1835 | goto err; |
8d1ebff4 RS |
1836 | |
1837 | for (consttime = 0; consttime < 2; consttime++) { | |
30bea14b RS |
1838 | if (!TEST_ptr(numerator = BN_new()) |
1839 | || !TEST_ptr(denominator = BN_new())) | |
0f113f3e | 1840 | goto err; |
8d1ebff4 RS |
1841 | if (consttime) { |
1842 | BN_set_flags(numerator, BN_FLG_CONSTTIME); | |
1843 | BN_set_flags(denominator, BN_FLG_CONSTTIME); | |
1844 | } | |
1845 | /* Test that BN_div never gives negative zero in the quotient. */ | |
30bea14b RS |
1846 | if (!TEST_true(BN_set_word(numerator, 1)) |
1847 | || !TEST_true(BN_set_word(denominator, 2))) | |
0f113f3e | 1848 | goto err; |
8d1ebff4 | 1849 | BN_set_negative(numerator, 1); |
30bea14b | 1850 | if (!TEST_true(BN_div(a, b, numerator, denominator, ctx)) |
dc352c19 P |
1851 | || !TEST_BN_eq_zero(a) |
1852 | || !TEST_BN_ge_zero(a)) | |
0f113f3e | 1853 | goto err; |
0f113f3e | 1854 | |
8d1ebff4 | 1855 | /* Test that BN_div never gives negative zero in the remainder. */ |
30bea14b RS |
1856 | if (!TEST_true(BN_set_word(denominator, 1)) |
1857 | || !TEST_true(BN_div(a, b, numerator, denominator, ctx)) | |
dc352c19 P |
1858 | || !TEST_BN_eq_zero(b) |
1859 | || !TEST_BN_ge_zero(b)) | |
0f113f3e | 1860 | goto err; |
8d1ebff4 RS |
1861 | BN_free(numerator); |
1862 | BN_free(denominator); | |
1863 | numerator = denominator = NULL; | |
1864 | } | |
0f113f3e | 1865 | |
8d1ebff4 RS |
1866 | /* Test that BN_set_negative will not produce a negative zero. */ |
1867 | BN_zero(a); | |
1868 | BN_set_negative(a, 1); | |
30bea14b | 1869 | if (BN_is_negative(a)) |
8d1ebff4 | 1870 | goto err; |
8d1ebff4 | 1871 | st = 1; |
30bea14b | 1872 | |
8d1ebff4 | 1873 | err: |
23a1d5e9 RS |
1874 | BN_free(a); |
1875 | BN_free(b); | |
8d1ebff4 RS |
1876 | BN_free(c); |
1877 | BN_free(d); | |
1878 | BN_free(numerator); | |
1879 | BN_free(denominator); | |
1880 | return st; | |
0f113f3e | 1881 | } |
c7820896 | 1882 | |
31a80694 | 1883 | static int test_badmod(void) |
0f113f3e | 1884 | { |
30bea14b RS |
1885 | BIGNUM *a = NULL, *b = NULL, *zero = NULL; |
1886 | BN_MONT_CTX *mont = NULL; | |
8d1ebff4 | 1887 | int st = 0; |
0f113f3e | 1888 | |
30bea14b RS |
1889 | if (!TEST_ptr(a = BN_new()) |
1890 | || !TEST_ptr(b = BN_new()) | |
1891 | || !TEST_ptr(zero = BN_new()) | |
1892 | || !TEST_ptr(mont = BN_MONT_CTX_new())) | |
0f113f3e | 1893 | goto err; |
8d1ebff4 | 1894 | BN_zero(zero); |
0f113f3e | 1895 | |
30bea14b | 1896 | if (!TEST_false(BN_div(a, b, BN_value_one(), zero, ctx))) |
8d1ebff4 | 1897 | goto err; |
8d1ebff4 | 1898 | ERR_clear_error(); |
0f113f3e | 1899 | |
30bea14b | 1900 | if (!TEST_false(BN_mod_mul(a, BN_value_one(), BN_value_one(), zero, ctx))) |
8d1ebff4 | 1901 | goto err; |
8d1ebff4 | 1902 | ERR_clear_error(); |
0f113f3e | 1903 | |
30bea14b | 1904 | if (!TEST_false(BN_mod_exp(a, BN_value_one(), BN_value_one(), zero, ctx))) |
8d1ebff4 | 1905 | goto err; |
8d1ebff4 | 1906 | ERR_clear_error(); |
0f113f3e | 1907 | |
30bea14b RS |
1908 | if (!TEST_false(BN_mod_exp_mont(a, BN_value_one(), BN_value_one(), |
1909 | zero, ctx, NULL))) | |
8d1ebff4 | 1910 | goto err; |
8d1ebff4 | 1911 | ERR_clear_error(); |
0f113f3e | 1912 | |
30bea14b RS |
1913 | if (!TEST_false(BN_mod_exp_mont_consttime(a, BN_value_one(), BN_value_one(), |
1914 | zero, ctx, NULL))) | |
8d1ebff4 | 1915 | goto err; |
8d1ebff4 | 1916 | ERR_clear_error(); |
0f113f3e | 1917 | |
30bea14b | 1918 | if (!TEST_false(BN_MONT_CTX_set(mont, zero, ctx))) |
8d1ebff4 | 1919 | goto err; |
8d1ebff4 | 1920 | ERR_clear_error(); |
0f113f3e | 1921 | |
8d1ebff4 | 1922 | /* Some operations also may not be used with an even modulus. */ |
30bea14b | 1923 | if (!TEST_true(BN_set_word(b, 16))) |
8d1ebff4 | 1924 | goto err; |
0f113f3e | 1925 | |
30bea14b | 1926 | if (!TEST_false(BN_MONT_CTX_set(mont, b, ctx))) |
8d1ebff4 | 1927 | goto err; |
8d1ebff4 | 1928 | ERR_clear_error(); |
0f113f3e | 1929 | |
30bea14b RS |
1930 | if (!TEST_false(BN_mod_exp_mont(a, BN_value_one(), BN_value_one(), |
1931 | b, ctx, NULL))) | |
8d1ebff4 | 1932 | goto err; |
8d1ebff4 RS |
1933 | ERR_clear_error(); |
1934 | ||
30bea14b RS |
1935 | if (!TEST_false(BN_mod_exp_mont_consttime(a, BN_value_one(), BN_value_one(), |
1936 | b, ctx, NULL))) | |
8d1ebff4 | 1937 | goto err; |
8d1ebff4 RS |
1938 | ERR_clear_error(); |
1939 | ||
1940 | st = 1; | |
1941 | err: | |
23a1d5e9 | 1942 | BN_free(a); |
8d1ebff4 RS |
1943 | BN_free(b); |
1944 | BN_free(zero); | |
1945 | BN_MONT_CTX_free(mont); | |
1946 | return st; | |
0f113f3e MC |
1947 | } |
1948 | ||
31a80694 | 1949 | static int test_expmodzero(void) |
0f113f3e | 1950 | { |
30bea14b | 1951 | BIGNUM *a = NULL, *r = NULL, *zero = NULL; |
8d1ebff4 | 1952 | int st = 0; |
0f113f3e | 1953 | |
30bea14b RS |
1954 | if (!TEST_ptr(zero = BN_new()) |
1955 | || !TEST_ptr(a = BN_new()) | |
1956 | || !TEST_ptr(r = BN_new())) | |
0f113f3e | 1957 | goto err; |
8d1ebff4 RS |
1958 | BN_zero(zero); |
1959 | ||
30bea14b | 1960 | if (!TEST_true(BN_mod_exp(r, a, zero, BN_value_one(), NULL)) |
dc352c19 | 1961 | || !TEST_BN_eq_zero(r) |
30bea14b RS |
1962 | || !TEST_true(BN_mod_exp_mont(r, a, zero, BN_value_one(), |
1963 | NULL, NULL)) | |
dc352c19 | 1964 | || !TEST_BN_eq_zero(r) |
30bea14b RS |
1965 | || !TEST_true(BN_mod_exp_mont_consttime(r, a, zero, |
1966 | BN_value_one(), | |
1967 | NULL, NULL)) | |
dc352c19 | 1968 | || !TEST_BN_eq_zero(r) |
30bea14b RS |
1969 | || !TEST_true(BN_mod_exp_mont_word(r, 42, zero, |
1970 | BN_value_one(), NULL, NULL)) | |
dc352c19 | 1971 | || !TEST_BN_eq_zero(r)) |
0f113f3e | 1972 | goto err; |
0f113f3e | 1973 | |
8d1ebff4 RS |
1974 | st = 1; |
1975 | err: | |
1976 | BN_free(zero); | |
1977 | BN_free(a); | |
1978 | BN_free(r); | |
1979 | return st; | |
0f113f3e MC |
1980 | } |
1981 | ||
31a80694 | 1982 | static int test_smallprime(void) |
8ff70f33 | 1983 | { |
8d1ebff4 | 1984 | static const int kBits = 10; |
30bea14b | 1985 | BIGNUM *r; |
8d1ebff4 | 1986 | int st = 0; |
8ff70f33 | 1987 | |
30bea14b RS |
1988 | if (!TEST_ptr(r = BN_new()) |
1989 | || !TEST_true(BN_generate_prime_ex(r, (int)kBits, 0, | |
1990 | NULL, NULL, NULL)) | |
1991 | || !TEST_int_eq(BN_num_bits(r), kBits)) | |
8d1ebff4 | 1992 | goto err; |
8ff70f33 | 1993 | |
8d1ebff4 RS |
1994 | st = 1; |
1995 | err: | |
1996 | BN_free(r); | |
1997 | return st; | |
1998 | } | |
8ff70f33 | 1999 | |
31a80694 | 2000 | static int test_3_is_prime(void) |
6e64c560 AL |
2001 | { |
2002 | int ret = 0; | |
30bea14b | 2003 | BIGNUM *r = NULL; |
6e64c560 | 2004 | |
30bea14b RS |
2005 | /* |
2006 | * For a long time, small primes were not considered prime when | |
2007 | * do_trial_division was set. | |
2008 | */ | |
2009 | if (!TEST_ptr(r = BN_new()) | |
2010 | || !TEST_true(BN_set_word(r, 3)) | |
2011 | || !TEST_int_eq(BN_is_prime_fasttest_ex(r, 3 /* nchecks */, ctx, | |
2012 | 0 /* do_trial_division */, NULL), 1) | |
2013 | || !TEST_int_eq(BN_is_prime_fasttest_ex(r, 3 /* nchecks */, ctx, | |
2014 | 1 /* do_trial_division */, NULL), 1)) | |
6e64c560 | 2015 | goto err; |
6e64c560 AL |
2016 | |
2017 | ret = 1; | |
2018 | ||
2019 | err: | |
2020 | BN_free(r); | |
2021 | return ret; | |
2022 | } | |
2023 | ||
8d1ebff4 | 2024 | static int file_test_run(STANZA *s) |
0f113f3e | 2025 | { |
8d1ebff4 RS |
2026 | static const FILETEST filetests[] = { |
2027 | {"Sum", file_sum}, | |
2028 | {"LShift1", file_lshift1}, | |
2029 | {"LShift", file_lshift}, | |
2030 | {"RShift", file_rshift}, | |
2031 | {"Square", file_square}, | |
2032 | {"Product", file_product}, | |
2033 | {"Quotient", file_quotient}, | |
2034 | {"ModMul", file_modmul}, | |
2035 | {"ModExp", file_modexp}, | |
2036 | {"Exp", file_exp}, | |
2037 | {"ModSqrt", file_modsqrt}, | |
2038 | }; | |
2039 | int numtests = OSSL_NELEM(filetests); | |
2040 | const FILETEST *tp = filetests; | |
0f113f3e | 2041 | |
8d1ebff4 | 2042 | for ( ; --numtests >= 0; tp++) { |
30bea14b RS |
2043 | if (findattr(s, tp->name) != NULL) { |
2044 | if (!tp->func(s)) { | |
ae269dd8 RS |
2045 | TEST_info("%s:%d: Failed %s test", |
2046 | s->test_file, s->start, tp->name); | |
30bea14b RS |
2047 | return 0; |
2048 | } | |
2049 | return 1; | |
2050 | } | |
0f113f3e | 2051 | } |
ae269dd8 | 2052 | TEST_info("%s:%d: Unknown test", s->test_file, s->start); |
8d1ebff4 | 2053 | return 0; |
0f113f3e | 2054 | } |
d02b48c6 | 2055 | |
e1cfd184 | 2056 | static int run_file_tests(int i) |
0f113f3e | 2057 | { |
ae269dd8 | 2058 | STANZA *s = NULL; |
ad887416 | 2059 | char *testfile = test_get_argument(i); |
ae269dd8 | 2060 | int c; |
0f113f3e | 2061 | |
ae269dd8 | 2062 | if (!TEST_ptr(s = OPENSSL_zalloc(sizeof(*s)))) |
e1cfd184 | 2063 | return 0; |
ad887416 | 2064 | if (!test_start_file(s, testfile)) { |
ae269dd8 RS |
2065 | OPENSSL_free(s); |
2066 | return 0; | |
2067 | } | |
e1cfd184 | 2068 | |
8d1ebff4 | 2069 | /* Read test file. */ |
ae269dd8 RS |
2070 | while (!BIO_eof(s->fp) && test_readstanza(s)) { |
2071 | if (s->numpairs == 0) | |
8d1ebff4 | 2072 | continue; |
ae269dd8 RS |
2073 | if (!file_test_run(s)) |
2074 | s->errors++; | |
2075 | s->numtests++; | |
2076 | test_clearstanza(s); | |
0f113f3e | 2077 | } |
ae269dd8 RS |
2078 | test_end_file(s); |
2079 | c = s->errors; | |
2080 | OPENSSL_free(s); | |
8d1ebff4 | 2081 | |
ae269dd8 | 2082 | return c == 0; |
0f113f3e | 2083 | } |
d02b48c6 | 2084 | |
e1cfd184 | 2085 | |
ad887416 | 2086 | int setup_tests(void) |
0f113f3e | 2087 | { |
ad887416 | 2088 | int n = test_get_argument_count(); |
8d1ebff4 | 2089 | |
e1cfd184 | 2090 | if (!TEST_ptr(ctx = BN_CTX_new())) |
ad887416 | 2091 | return 0; |
e1cfd184 | 2092 | |
ad887416 | 2093 | if (n == 0) { |
e1cfd184 RS |
2094 | ADD_TEST(test_sub); |
2095 | ADD_TEST(test_div_recip); | |
2096 | ADD_TEST(test_mod); | |
2097 | ADD_TEST(test_modexp_mont5); | |
2098 | ADD_TEST(test_kronecker); | |
2099 | ADD_TEST(test_rand); | |
2100 | ADD_TEST(test_bn2padded); | |
2101 | ADD_TEST(test_dec2bn); | |
2102 | ADD_TEST(test_hex2bn); | |
2103 | ADD_TEST(test_asc2bn); | |
2104 | ADD_ALL_TESTS(test_mpi, (int)OSSL_NELEM(kMPITests)); | |
2105 | ADD_TEST(test_negzero); | |
2106 | ADD_TEST(test_badmod); | |
2107 | ADD_TEST(test_expmodzero); | |
2108 | ADD_TEST(test_smallprime); | |
8d1ebff4 | 2109 | #ifndef OPENSSL_NO_EC2M |
e1cfd184 RS |
2110 | ADD_TEST(test_gf2m_add); |
2111 | ADD_TEST(test_gf2m_mod); | |
2112 | ADD_TEST(test_gf2m_mul); | |
2113 | ADD_TEST(test_gf2m_sqr); | |
2114 | ADD_TEST(test_gf2m_modinv); | |
2115 | ADD_TEST(test_gf2m_moddiv); | |
2116 | ADD_TEST(test_gf2m_modexp); | |
2117 | ADD_TEST(test_gf2m_modsqrt); | |
2118 | ADD_TEST(test_gf2m_modsolvequad); | |
8d1ebff4 | 2119 | #endif |
e1cfd184 RS |
2120 | ADD_TEST(test_3_is_prime); |
2121 | } else { | |
ad887416 | 2122 | ADD_ALL_TESTS(run_file_tests, n); |
e1cfd184 | 2123 | } |
ad887416 P |
2124 | return 1; |
2125 | } | |
8d1ebff4 | 2126 | |
ad887416 P |
2127 | void cleanup_tests(void) |
2128 | { | |
8d1ebff4 | 2129 | BN_CTX_free(ctx); |
0f113f3e | 2130 | } |