1 /* crypto/bn/bntest.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
5 * This package is an SSL implementation written
6 * by Eric Young (eay@cryptsoft.com).
7 * The implementation was written so as to conform with Netscapes SSL.
9 * This library is free for commercial and non-commercial use as long as
10 * the following conditions are aheared to. The following conditions
11 * apply to all code found in this distribution, be it the RC4, RSA,
12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 * included with this distribution is covered by the same copyright terms
14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
16 * Copyright remains Eric Young's, and as such any Copyright notices in
17 * the code are not to be removed.
18 * If this package is used in a product, Eric Young should be given attribution
19 * as the author of the parts of the library used.
20 * This can be in the form of a textual message at program startup or
21 * in documentation (online or textual) provided with the package.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
58 /* ====================================================================
59 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
61 * Portions of the attached software ("Contribution") are developed by
62 * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
64 * The Contribution is licensed pursuant to the Eric Young open source
65 * license provided above.
67 * The binary polynomial arithmetic software is originally written by
68 * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories.
78 #include <openssl/bio.h>
79 #include <openssl/bn.h>
80 #include <openssl/rand.h>
81 #include <openssl/x509.h>
82 #include <openssl/err.h>
84 #include "../crypto/bn/bn_lcl.h"
86 const int num0 = 100; /* number of tests */
87 const int num1 = 50; /* additional tests for some functions */
88 const int num2 = 5; /* number of tests for slow functions */
90 int test_add(BIO *bp);
91 int test_sub(BIO *bp);
92 int test_lshift1(BIO *bp);
93 int test_lshift(BIO *bp, BN_CTX *ctx, BIGNUM *a_);
94 int test_rshift1(BIO *bp);
95 int test_rshift(BIO *bp, BN_CTX *ctx);
96 int test_div(BIO *bp, BN_CTX *ctx);
97 int test_div_word(BIO *bp);
98 int test_div_recp(BIO *bp, BN_CTX *ctx);
99 int test_mul(BIO *bp);
100 int test_sqr(BIO *bp, BN_CTX *ctx);
101 int test_mont(BIO *bp, BN_CTX *ctx);
102 int test_mod(BIO *bp, BN_CTX *ctx);
103 int test_mod_mul(BIO *bp, BN_CTX *ctx);
104 int test_mod_exp(BIO *bp, BN_CTX *ctx);
105 int test_mod_exp_mont_consttime(BIO *bp, BN_CTX *ctx);
106 int test_mod_exp_mont5(BIO *bp, BN_CTX *ctx);
107 int test_exp(BIO *bp, BN_CTX *ctx);
108 int test_gf2m_add(BIO *bp);
109 int test_gf2m_mod(BIO *bp);
110 int test_gf2m_mod_mul(BIO *bp, BN_CTX *ctx);
111 int test_gf2m_mod_sqr(BIO *bp, BN_CTX *ctx);
112 int test_gf2m_mod_inv(BIO *bp, BN_CTX *ctx);
113 int test_gf2m_mod_div(BIO *bp, BN_CTX *ctx);
114 int test_gf2m_mod_exp(BIO *bp, BN_CTX *ctx);
115 int test_gf2m_mod_sqrt(BIO *bp, BN_CTX *ctx);
116 int test_gf2m_mod_solve_quad(BIO *bp, BN_CTX *ctx);
117 int test_kron(BIO *bp, BN_CTX *ctx);
118 int test_sqrt(BIO *bp, BN_CTX *ctx);
119 int test_small_prime(BIO *bp, BN_CTX *ctx);
120 int test_probable_prime_coprime(BIO *bp, BN_CTX *ctx);
122 static int results = 0;
124 static unsigned char lst[] =
125 "\xC6\x4F\x43\x04\x2A\xEA\xCA\x6E\x58\x36\x80\x5B\xE8\xC9"
126 "\x9B\x04\x5D\x48\x36\xC2\xFD\x16\xC9\x64\xF0";
128 static const char rnd_seed[] =
129 "string to make the random number generator think it has entropy";
131 static void message(BIO *out, char *m)
133 fprintf(stderr, "test %s\n", m);
134 BIO_puts(out, "print \"test ");
136 BIO_puts(out, "\\n\"\n");
139 int main(int argc, char *argv[])
143 char *outfile = NULL;
147 RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_generate_prime may fail */
152 if (strcmp(*argv, "-results") == 0)
154 else if (strcmp(*argv, "-out") == 0) {
167 out = BIO_new(BIO_s_file());
170 if (outfile == NULL) {
171 BIO_set_fp(out, stdout, BIO_NOCLOSE);
173 if (!BIO_write_filename(out, outfile)) {
180 BIO_puts(out, "obase=16\nibase=16\n");
182 message(out, "BN_add");
185 (void)BIO_flush(out);
187 message(out, "BN_sub");
190 (void)BIO_flush(out);
192 message(out, "BN_lshift1");
193 if (!test_lshift1(out))
195 (void)BIO_flush(out);
197 message(out, "BN_lshift (fixed)");
198 if (!test_lshift(out, ctx, BN_bin2bn(lst, sizeof(lst) - 1, NULL)))
200 (void)BIO_flush(out);
202 message(out, "BN_lshift");
203 if (!test_lshift(out, ctx, NULL))
205 (void)BIO_flush(out);
207 message(out, "BN_rshift1");
208 if (!test_rshift1(out))
210 (void)BIO_flush(out);
212 message(out, "BN_rshift");
213 if (!test_rshift(out, ctx))
215 (void)BIO_flush(out);
217 message(out, "BN_sqr");
218 if (!test_sqr(out, ctx))
220 (void)BIO_flush(out);
222 message(out, "BN_mul");
225 (void)BIO_flush(out);
227 message(out, "BN_div");
228 if (!test_div(out, ctx))
230 (void)BIO_flush(out);
232 message(out, "BN_div_word");
233 if (!test_div_word(out))
235 (void)BIO_flush(out);
237 message(out, "BN_div_recp");
238 if (!test_div_recp(out, ctx))
240 (void)BIO_flush(out);
242 message(out, "BN_mod");
243 if (!test_mod(out, ctx))
245 (void)BIO_flush(out);
247 message(out, "BN_mod_mul");
248 if (!test_mod_mul(out, ctx))
250 (void)BIO_flush(out);
252 message(out, "BN_mont");
253 if (!test_mont(out, ctx))
255 (void)BIO_flush(out);
257 message(out, "BN_mod_exp");
258 if (!test_mod_exp(out, ctx))
260 (void)BIO_flush(out);
262 message(out, "BN_mod_exp_mont_consttime");
263 if (!test_mod_exp_mont_consttime(out, ctx))
265 if (!test_mod_exp_mont5(out, ctx))
267 (void)BIO_flush(out);
269 message(out, "BN_exp");
270 if (!test_exp(out, ctx))
272 (void)BIO_flush(out);
274 message(out, "BN_kronecker");
275 if (!test_kron(out, ctx))
277 (void)BIO_flush(out);
279 message(out, "BN_mod_sqrt");
280 if (!test_sqrt(out, ctx))
282 (void)BIO_flush(out);
284 message(out, "Small prime generation");
285 if (!test_small_prime(out, ctx))
287 (void)BIO_flush(out);
289 #ifdef OPENSSL_SYS_WIN32
290 message(out, "Probable prime generation with coprimes disabled");
292 message(out, "Probable prime generation with coprimes");
293 if (!test_probable_prime_coprime(out, ctx))
296 (void)BIO_flush(out);
298 #ifndef OPENSSL_NO_EC2M
299 message(out, "BN_GF2m_add");
300 if (!test_gf2m_add(out))
302 (void)BIO_flush(out);
304 message(out, "BN_GF2m_mod");
305 if (!test_gf2m_mod(out))
307 (void)BIO_flush(out);
309 message(out, "BN_GF2m_mod_mul");
310 if (!test_gf2m_mod_mul(out, ctx))
312 (void)BIO_flush(out);
314 message(out, "BN_GF2m_mod_sqr");
315 if (!test_gf2m_mod_sqr(out, ctx))
317 (void)BIO_flush(out);
319 message(out, "BN_GF2m_mod_inv");
320 if (!test_gf2m_mod_inv(out, ctx))
322 (void)BIO_flush(out);
324 message(out, "BN_GF2m_mod_div");
325 if (!test_gf2m_mod_div(out, ctx))
327 (void)BIO_flush(out);
329 message(out, "BN_GF2m_mod_exp");
330 if (!test_gf2m_mod_exp(out, ctx))
332 (void)BIO_flush(out);
334 message(out, "BN_GF2m_mod_sqrt");
335 if (!test_gf2m_mod_sqrt(out, ctx))
337 (void)BIO_flush(out);
339 message(out, "BN_GF2m_mod_solve_quad");
340 if (!test_gf2m_mod_solve_quad(out, ctx))
342 (void)BIO_flush(out);
349 BIO_puts(out, "1\n"); /* make sure the Perl script fed by bc
350 * notices the failure, see test_bn in
351 * test/Makefile.ssl */
352 (void)BIO_flush(out);
353 ERR_load_crypto_strings();
354 ERR_print_errors_fp(stderr);
359 int test_add(BIO *bp)
368 BN_bntest_rand(a, 512, 0, 0);
369 for (i = 0; i < num0; i++) {
370 BN_bntest_rand(b, 450 + i, 0, 0);
388 if (!BN_is_zero(c)) {
389 fprintf(stderr, "Add test failed!\n");
399 int test_sub(BIO *bp)
408 for (i = 0; i < num0 + num1; i++) {
410 BN_bntest_rand(a, 512, 0, 0);
412 if (BN_set_bit(a, i) == 0)
416 BN_bntest_rand(b, 400 + i - num1, 0, 0);
433 if (!BN_is_zero(c)) {
434 fprintf(stderr, "Subtract test failed!\n");
444 int test_div(BIO *bp, BN_CTX *ctx)
446 BIGNUM *a, *b, *c, *d, *e;
455 for (i = 0; i < num0 + num1; i++) {
457 BN_bntest_rand(a, 400, 0, 0);
462 BN_bntest_rand(b, 50 + 3 * (i - num1), 0, 0);
465 BN_div(d, c, a, b, ctx);
485 BN_mul(e, d, b, ctx);
488 if (!BN_is_zero(d)) {
489 fprintf(stderr, "Division test failed!\n");
501 static void print_word(BIO *bp, BN_ULONG w)
503 #ifdef SIXTY_FOUR_BIT
504 if (sizeof(w) > sizeof(unsigned long)) {
505 unsigned long h = (unsigned long)(w >> 32), l = (unsigned long)(w);
508 BIO_printf(bp, "%lX%08lX", h, l);
510 BIO_printf(bp, "%lX", l);
514 BIO_printf(bp, BN_HEX_FMT1, w);
517 int test_div_word(BIO *bp)
526 for (i = 0; i < num0; i++) {
528 BN_bntest_rand(a, 512, -1, 0);
529 BN_bntest_rand(b, BN_BITS2, -1, 0);
534 r = BN_div_word(b, s);
558 if (!BN_is_zero(b)) {
559 fprintf(stderr, "Division (word) test failed!\n");
568 int test_div_recp(BIO *bp, BN_CTX *ctx)
570 BIGNUM *a, *b, *c, *d, *e;
574 recp = BN_RECP_CTX_new();
581 for (i = 0; i < num0 + num1; i++) {
583 BN_bntest_rand(a, 400, 0, 0);
588 BN_bntest_rand(b, 50 + 3 * (i - num1), 0, 0);
591 BN_RECP_CTX_set(recp, b, ctx);
592 BN_div_recp(d, c, a, recp, ctx);
612 BN_mul(e, d, b, ctx);
615 if (!BN_is_zero(d)) {
616 fprintf(stderr, "Reciprocal division test failed!\n");
617 fprintf(stderr, "a=");
618 BN_print_fp(stderr, a);
619 fprintf(stderr, "\nb=");
620 BN_print_fp(stderr, b);
621 fprintf(stderr, "\n");
630 BN_RECP_CTX_free(recp);
634 int test_mul(BIO *bp)
636 BIGNUM *a, *b, *c, *d, *e;
650 for (i = 0; i < num0 + num1; i++) {
652 BN_bntest_rand(a, 100, 0, 0);
653 BN_bntest_rand(b, 100, 0, 0);
655 BN_bntest_rand(b, i - num1, 0, 0);
658 BN_mul(c, a, b, ctx);
669 BN_div(d, e, c, a, ctx);
671 if (!BN_is_zero(d) || !BN_is_zero(e)) {
672 fprintf(stderr, "Multiplication test failed!\n");
685 int test_sqr(BIO *bp, BN_CTX *ctx)
687 BIGNUM *a, *c, *d, *e;
694 if (a == NULL || c == NULL || d == NULL || e == NULL) {
698 for (i = 0; i < num0; i++) {
699 BN_bntest_rand(a, 40 + i * 10, 0, 0);
712 BN_div(d, e, c, a, ctx);
714 if (!BN_is_zero(d) || !BN_is_zero(e)) {
715 fprintf(stderr, "Square test failed!\n");
720 /* Regression test for a BN_sqr overflow bug. */
722 "80000000000000008000000000000001"
723 "FFFFFFFFFFFFFFFE0000000000000000");
735 BN_mul(d, a, a, ctx);
737 fprintf(stderr, "Square test failed: BN_sqr and BN_mul produce "
738 "different results!\n");
742 /* Regression test for a BN_sqr overflow bug. */
744 "80000000000000000000000080000001"
745 "FFFFFFFE000000000000000000000000");
757 BN_mul(d, a, a, ctx);
759 fprintf(stderr, "Square test failed: BN_sqr and BN_mul produce "
760 "different results!\n");
776 int test_mont(BIO *bp, BN_CTX *ctx)
778 BIGNUM *a, *b, *c, *d, *A, *B;
791 mont = BN_MONT_CTX_new();
795 BN_bntest_rand(a, 100, 0, 0);
796 BN_bntest_rand(b, 100, 0, 0);
797 for (i = 0; i < num2; i++) {
798 int bits = (200 * (i + 1)) / num2;
802 BN_bntest_rand(n, bits, 0, 1);
803 BN_MONT_CTX_set(mont, n, ctx);
805 BN_nnmod(a, a, n, ctx);
806 BN_nnmod(b, b, n, ctx);
808 BN_to_montgomery(A, a, mont, ctx);
809 BN_to_montgomery(B, b, mont, ctx);
811 BN_mod_mul_montgomery(c, A, B, mont, ctx);
812 BN_from_montgomery(A, c, mont, ctx);
819 BN_print(bp, &mont->N);
825 BN_mod_mul(d, a, b, n, ctx);
827 if (!BN_is_zero(d)) {
828 fprintf(stderr, "Montgomery multiplication test failed!\n");
832 BN_MONT_CTX_free(mont);
843 int test_mod(BIO *bp, BN_CTX *ctx)
845 BIGNUM *a, *b, *c, *d, *e;
854 BN_bntest_rand(a, 1024, 0, 0);
855 for (i = 0; i < num0; i++) {
856 BN_bntest_rand(b, 450 + i * 10, 0, 0);
859 BN_mod(c, a, b, ctx);
870 BN_div(d, e, a, b, ctx);
872 if (!BN_is_zero(e)) {
873 fprintf(stderr, "Modulo test failed!\n");
885 int test_mod_mul(BIO *bp, BN_CTX *ctx)
887 BIGNUM *a, *b, *c, *d, *e;
896 for (j = 0; j < 3; j++) {
897 BN_bntest_rand(c, 1024, 0, 0);
898 for (i = 0; i < num0; i++) {
899 BN_bntest_rand(a, 475 + i * 10, 0, 0);
900 BN_bntest_rand(b, 425 + i * 11, 0, 0);
903 if (!BN_mod_mul(e, a, b, c, ctx)) {
906 while ((l = ERR_get_error()))
907 fprintf(stderr, "ERROR:%s\n", ERR_error_string(l, NULL));
917 if ((a->neg ^ b->neg) && !BN_is_zero(e)) {
919 * If (a*b) % c is negative, c must be added in order
920 * to obtain the normalized remainder (new with
921 * OpenSSL 0.9.7, previous versions of BN_mod_mul
922 * could generate negative results)
932 BN_mul(d, a, b, ctx);
934 BN_div(a, b, d, c, ctx);
935 if (!BN_is_zero(b)) {
936 fprintf(stderr, "Modulo multiply test failed!\n");
937 ERR_print_errors_fp(stderr);
950 int test_mod_exp(BIO *bp, BN_CTX *ctx)
952 BIGNUM *a, *b, *c, *d, *e;
961 BN_bntest_rand(c, 30, 0, 1); /* must be odd for montgomery */
962 for (i = 0; i < num2; i++) {
963 BN_bntest_rand(a, 20 + i * 5, 0, 0);
964 BN_bntest_rand(b, 2 + i, 0, 0);
966 if (!BN_mod_exp(d, a, b, c, ctx))
981 BN_exp(e, a, b, ctx);
983 BN_div(a, b, e, c, ctx);
984 if (!BN_is_zero(b)) {
985 fprintf(stderr, "Modulo exponentiation test failed!\n");
997 int test_mod_exp_mont_consttime(BIO *bp, BN_CTX *ctx)
999 BIGNUM *a, *b, *c, *d, *e;
1008 BN_bntest_rand(c, 30, 0, 1); /* must be odd for montgomery */
1009 for (i = 0; i < num2; i++) {
1010 BN_bntest_rand(a, 20 + i * 5, 0, 0);
1011 BN_bntest_rand(b, 2 + i, 0, 0);
1013 if (!BN_mod_exp_mont_consttime(d, a, b, c, ctx, NULL))
1019 BIO_puts(bp, " ^ ");
1021 BIO_puts(bp, " % ");
1023 BIO_puts(bp, " - ");
1028 BN_exp(e, a, b, ctx);
1030 BN_div(a, b, e, c, ctx);
1031 if (!BN_is_zero(b)) {
1032 fprintf(stderr, "Modulo exponentiation test failed!\n");
1045 * Test constant-time modular exponentiation with 1024-bit inputs, which on
1046 * x86_64 cause a different code branch to be taken.
1048 int test_mod_exp_mont5(BIO *bp, BN_CTX *ctx)
1050 BIGNUM *a, *p, *m, *d, *e;
1060 mont = BN_MONT_CTX_new();
1062 BN_bntest_rand(m, 1024, 0, 1); /* must be odd for montgomery */
1064 BN_bntest_rand(a, 1024, 0, 0);
1066 if (!BN_mod_exp_mont_consttime(d, a, p, m, ctx, NULL))
1068 if (!BN_is_one(d)) {
1069 fprintf(stderr, "Modular exponentiation test failed!\n");
1073 BN_bntest_rand(p, 1024, 0, 0);
1075 if (!BN_mod_exp_mont_consttime(d, a, p, m, ctx, NULL))
1077 if (!BN_is_zero(d)) {
1078 fprintf(stderr, "Modular exponentiation test failed!\n");
1082 * Craft an input whose Montgomery representation is 1, i.e., shorter
1083 * than the modulus m, in order to test the const time precomputation
1084 * scattering/gathering.
1087 BN_MONT_CTX_set(mont, m, ctx);
1088 if (!BN_from_montgomery(e, a, mont, ctx))
1090 if (!BN_mod_exp_mont_consttime(d, e, p, m, ctx, NULL))
1092 if (!BN_mod_exp_simple(a, e, p, m, ctx))
1094 if (BN_cmp(a, d) != 0) {
1095 fprintf(stderr, "Modular exponentiation test failed!\n");
1098 /* Finally, some regular test vectors. */
1099 BN_bntest_rand(e, 1024, 0, 0);
1100 if (!BN_mod_exp_mont_consttime(d, e, p, m, ctx, NULL))
1102 if (!BN_mod_exp_simple(a, e, p, m, ctx))
1104 if (BN_cmp(a, d) != 0) {
1105 fprintf(stderr, "Modular exponentiation test failed!\n");
1116 int test_exp(BIO *bp, BN_CTX *ctx)
1118 BIGNUM *a, *b, *d, *e, *one;
1128 for (i = 0; i < num2; i++) {
1129 BN_bntest_rand(a, 20 + i * 5, 0, 0);
1130 BN_bntest_rand(b, 2 + i, 0, 0);
1132 if (BN_exp(d, a, b, ctx) <= 0)
1138 BIO_puts(bp, " ^ ");
1140 BIO_puts(bp, " - ");
1146 for (; !BN_is_zero(b); BN_sub(b, b, one))
1147 BN_mul(e, e, a, ctx);
1149 if (!BN_is_zero(e)) {
1150 fprintf(stderr, "Exponentiation test failed!\n");
1162 #ifndef OPENSSL_NO_EC2M
1163 int test_gf2m_add(BIO *bp)
1172 for (i = 0; i < num0; i++) {
1173 BN_rand(a, 512, 0, 0);
1174 BN_copy(b, BN_value_one());
1175 a->neg = rand_neg();
1176 b->neg = rand_neg();
1177 BN_GF2m_add(c, a, b);
1178 # if 0 /* make test uses ouput in bc but bc can't
1179 * handle GF(2^m) arithmetic */
1183 BIO_puts(bp, " ^ ");
1185 BIO_puts(bp, " = ");
1191 /* Test that two added values have the correct parity. */
1192 if ((BN_is_odd(a) && BN_is_odd(c))
1193 || (!BN_is_odd(a) && !BN_is_odd(c))) {
1194 fprintf(stderr, "GF(2^m) addition test (a) failed!\n");
1197 BN_GF2m_add(c, c, c);
1198 /* Test that c + c = 0. */
1199 if (!BN_is_zero(c)) {
1200 fprintf(stderr, "GF(2^m) addition test (b) failed!\n");
1212 int test_gf2m_mod(BIO *bp)
1214 BIGNUM *a, *b[2], *c, *d, *e;
1216 int p0[] = { 163, 7, 6, 3, 0, -1 };
1217 int p1[] = { 193, 15, 0, -1 };
1226 BN_GF2m_arr2poly(p0, b[0]);
1227 BN_GF2m_arr2poly(p1, b[1]);
1229 for (i = 0; i < num0; i++) {
1230 BN_bntest_rand(a, 1024, 0, 0);
1231 for (j = 0; j < 2; j++) {
1232 BN_GF2m_mod(c, a, b[j]);
1233 # if 0 /* make test uses ouput in bc but bc can't
1234 * handle GF(2^m) arithmetic */
1238 BIO_puts(bp, " % ");
1240 BIO_puts(bp, " - ");
1246 BN_GF2m_add(d, a, c);
1247 BN_GF2m_mod(e, d, b[j]);
1248 /* Test that a + (a mod p) mod p == 0. */
1249 if (!BN_is_zero(e)) {
1250 fprintf(stderr, "GF(2^m) modulo test failed!\n");
1266 int test_gf2m_mod_mul(BIO *bp, BN_CTX *ctx)
1268 BIGNUM *a, *b[2], *c, *d, *e, *f, *g, *h;
1270 int p0[] = { 163, 7, 6, 3, 0, -1 };
1271 int p1[] = { 193, 15, 0, -1 };
1283 BN_GF2m_arr2poly(p0, b[0]);
1284 BN_GF2m_arr2poly(p1, b[1]);
1286 for (i = 0; i < num0; i++) {
1287 BN_bntest_rand(a, 1024, 0, 0);
1288 BN_bntest_rand(c, 1024, 0, 0);
1289 BN_bntest_rand(d, 1024, 0, 0);
1290 for (j = 0; j < 2; j++) {
1291 BN_GF2m_mod_mul(e, a, c, b[j], ctx);
1292 # if 0 /* make test uses ouput in bc but bc can't
1293 * handle GF(2^m) arithmetic */
1297 BIO_puts(bp, " * ");
1299 BIO_puts(bp, " % ");
1301 BIO_puts(bp, " - ");
1307 BN_GF2m_add(f, a, d);
1308 BN_GF2m_mod_mul(g, f, c, b[j], ctx);
1309 BN_GF2m_mod_mul(h, d, c, b[j], ctx);
1310 BN_GF2m_add(f, e, g);
1311 BN_GF2m_add(f, f, h);
1312 /* Test that (a+d)*c = a*c + d*c. */
1313 if (!BN_is_zero(f)) {
1315 "GF(2^m) modular multiplication test failed!\n");
1334 int test_gf2m_mod_sqr(BIO *bp, BN_CTX *ctx)
1336 BIGNUM *a, *b[2], *c, *d;
1338 int p0[] = { 163, 7, 6, 3, 0, -1 };
1339 int p1[] = { 193, 15, 0, -1 };
1347 BN_GF2m_arr2poly(p0, b[0]);
1348 BN_GF2m_arr2poly(p1, b[1]);
1350 for (i = 0; i < num0; i++) {
1351 BN_bntest_rand(a, 1024, 0, 0);
1352 for (j = 0; j < 2; j++) {
1353 BN_GF2m_mod_sqr(c, a, b[j], ctx);
1355 BN_GF2m_mod_mul(d, a, d, b[j], ctx);
1356 # if 0 /* make test uses ouput in bc but bc can't
1357 * handle GF(2^m) arithmetic */
1361 BIO_puts(bp, " ^ 2 % ");
1363 BIO_puts(bp, " = ");
1365 BIO_puts(bp, "; a * a = ");
1371 BN_GF2m_add(d, c, d);
1372 /* Test that a*a = a^2. */
1373 if (!BN_is_zero(d)) {
1374 fprintf(stderr, "GF(2^m) modular squaring test failed!\n");
1389 int test_gf2m_mod_inv(BIO *bp, BN_CTX *ctx)
1391 BIGNUM *a, *b[2], *c, *d;
1393 int p0[] = { 163, 7, 6, 3, 0, -1 };
1394 int p1[] = { 193, 15, 0, -1 };
1402 BN_GF2m_arr2poly(p0, b[0]);
1403 BN_GF2m_arr2poly(p1, b[1]);
1405 for (i = 0; i < num0; i++) {
1406 BN_bntest_rand(a, 512, 0, 0);
1407 for (j = 0; j < 2; j++) {
1408 BN_GF2m_mod_inv(c, a, b[j], ctx);
1409 BN_GF2m_mod_mul(d, a, c, b[j], ctx);
1410 # if 0 /* make test uses ouput in bc but bc can't
1411 * handle GF(2^m) arithmetic */
1415 BIO_puts(bp, " * ");
1417 BIO_puts(bp, " - 1 % ");
1423 /* Test that ((1/a)*a) = 1. */
1424 if (!BN_is_one(d)) {
1425 fprintf(stderr, "GF(2^m) modular inversion test failed!\n");
1440 int test_gf2m_mod_div(BIO *bp, BN_CTX *ctx)
1442 BIGNUM *a, *b[2], *c, *d, *e, *f;
1444 int p0[] = { 163, 7, 6, 3, 0, -1 };
1445 int p1[] = { 193, 15, 0, -1 };
1455 BN_GF2m_arr2poly(p0, b[0]);
1456 BN_GF2m_arr2poly(p1, b[1]);
1458 for (i = 0; i < num0; i++) {
1459 BN_bntest_rand(a, 512, 0, 0);
1460 BN_bntest_rand(c, 512, 0, 0);
1461 for (j = 0; j < 2; j++) {
1462 BN_GF2m_mod_div(d, a, c, b[j], ctx);
1463 BN_GF2m_mod_mul(e, d, c, b[j], ctx);
1464 BN_GF2m_mod_div(f, a, e, b[j], ctx);
1465 # if 0 /* make test uses ouput in bc but bc can't
1466 * handle GF(2^m) arithmetic */
1470 BIO_puts(bp, " = ");
1472 BIO_puts(bp, " * ");
1474 BIO_puts(bp, " % ");
1480 /* Test that ((a/c)*c)/a = 1. */
1481 if (!BN_is_one(f)) {
1482 fprintf(stderr, "GF(2^m) modular division test failed!\n");
1499 int test_gf2m_mod_exp(BIO *bp, BN_CTX *ctx)
1501 BIGNUM *a, *b[2], *c, *d, *e, *f;
1503 int p0[] = { 163, 7, 6, 3, 0, -1 };
1504 int p1[] = { 193, 15, 0, -1 };
1514 BN_GF2m_arr2poly(p0, b[0]);
1515 BN_GF2m_arr2poly(p1, b[1]);
1517 for (i = 0; i < num0; i++) {
1518 BN_bntest_rand(a, 512, 0, 0);
1519 BN_bntest_rand(c, 512, 0, 0);
1520 BN_bntest_rand(d, 512, 0, 0);
1521 for (j = 0; j < 2; j++) {
1522 BN_GF2m_mod_exp(e, a, c, b[j], ctx);
1523 BN_GF2m_mod_exp(f, a, d, b[j], ctx);
1524 BN_GF2m_mod_mul(e, e, f, b[j], ctx);
1526 BN_GF2m_mod_exp(f, a, f, b[j], ctx);
1527 # if 0 /* make test uses ouput in bc but bc can't
1528 * handle GF(2^m) arithmetic */
1532 BIO_puts(bp, " ^ (");
1534 BIO_puts(bp, " + ");
1536 BIO_puts(bp, ") = ");
1538 BIO_puts(bp, "; - ");
1540 BIO_puts(bp, " % ");
1546 BN_GF2m_add(f, e, f);
1547 /* Test that a^(c+d)=a^c*a^d. */
1548 if (!BN_is_zero(f)) {
1550 "GF(2^m) modular exponentiation test failed!\n");
1567 int test_gf2m_mod_sqrt(BIO *bp, BN_CTX *ctx)
1569 BIGNUM *a, *b[2], *c, *d, *e, *f;
1571 int p0[] = { 163, 7, 6, 3, 0, -1 };
1572 int p1[] = { 193, 15, 0, -1 };
1582 BN_GF2m_arr2poly(p0, b[0]);
1583 BN_GF2m_arr2poly(p1, b[1]);
1585 for (i = 0; i < num0; i++) {
1586 BN_bntest_rand(a, 512, 0, 0);
1587 for (j = 0; j < 2; j++) {
1588 BN_GF2m_mod(c, a, b[j]);
1589 BN_GF2m_mod_sqrt(d, a, b[j], ctx);
1590 BN_GF2m_mod_sqr(e, d, b[j], ctx);
1591 # if 0 /* make test uses ouput in bc but bc can't
1592 * handle GF(2^m) arithmetic */
1596 BIO_puts(bp, " ^ 2 - ");
1602 BN_GF2m_add(f, c, e);
1603 /* Test that d^2 = a, where d = sqrt(a). */
1604 if (!BN_is_zero(f)) {
1605 fprintf(stderr, "GF(2^m) modular square root test failed!\n");
1622 int test_gf2m_mod_solve_quad(BIO *bp, BN_CTX *ctx)
1624 BIGNUM *a, *b[2], *c, *d, *e;
1625 int i, j, s = 0, t, ret = 0;
1626 int p0[] = { 163, 7, 6, 3, 0, -1 };
1627 int p1[] = { 193, 15, 0, -1 };
1636 BN_GF2m_arr2poly(p0, b[0]);
1637 BN_GF2m_arr2poly(p1, b[1]);
1639 for (i = 0; i < num0; i++) {
1640 BN_bntest_rand(a, 512, 0, 0);
1641 for (j = 0; j < 2; j++) {
1642 t = BN_GF2m_mod_solve_quad(c, a, b[j], ctx);
1645 BN_GF2m_mod_sqr(d, c, b[j], ctx);
1646 BN_GF2m_add(d, c, d);
1647 BN_GF2m_mod(e, a, b[j]);
1648 # if 0 /* make test uses ouput in bc but bc can't
1649 * handle GF(2^m) arithmetic */
1653 BIO_puts(bp, " is root of z^2 + z = ");
1655 BIO_puts(bp, " % ");
1661 BN_GF2m_add(e, e, d);
1663 * Test that solution of quadratic c satisfies c^2 + c = a.
1665 if (!BN_is_zero(e)) {
1667 "GF(2^m) modular solve quadratic test failed!\n");
1672 # if 0 /* make test uses ouput in bc but bc can't
1673 * handle GF(2^m) arithmetic */
1676 BIO_puts(bp, "There are no roots of z^2 + z = ");
1678 BIO_puts(bp, " % ");
1689 "All %i tests of GF(2^m) modular solve quadratic resulted in no roots;\n",
1692 "this is very unlikely and probably indicates an error.\n");
1706 static int genprime_cb(int p, int n, BN_GENCB *arg)
1723 int test_kron(BIO *bp, BN_CTX *ctx)
1726 BIGNUM *a, *b, *r, *t;
1728 int legendre, kronecker;
1735 if (a == NULL || b == NULL || r == NULL || t == NULL)
1738 BN_GENCB_set(&cb, genprime_cb, NULL);
1741 * We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol). In
1742 * this case we know that if b is prime, then BN_kronecker(a, b, ctx) is
1743 * congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol). So we
1744 * generate a random prime b and compare these values for a number of
1745 * random a's. (That is, we run the Solovay-Strassen primality test to
1746 * confirm that b is prime, except that we don't want to test whether b
1747 * is prime but whether BN_kronecker works.)
1750 if (!BN_generate_prime_ex(b, 512, 0, NULL, NULL, &cb))
1752 b->neg = rand_neg();
1755 for (i = 0; i < num0; i++) {
1756 if (!BN_bntest_rand(a, 512, 0, 0))
1758 a->neg = rand_neg();
1760 /* t := (|b|-1)/2 (note that b is odd) */
1764 if (!BN_sub_word(t, 1))
1766 if (!BN_rshift1(t, t))
1768 /* r := a^t mod b */
1771 if (!BN_mod_exp_recp(r, a, t, b, ctx))
1775 if (BN_is_word(r, 1))
1777 else if (BN_is_zero(r))
1780 if (!BN_add_word(r, 1))
1782 if (0 != BN_ucmp(r, b)) {
1783 fprintf(stderr, "Legendre symbol computation failed\n");
1789 kronecker = BN_kronecker(a, b, ctx);
1792 /* we actually need BN_kronecker(a, |b|) */
1793 if (a->neg && b->neg)
1794 kronecker = -kronecker;
1796 if (legendre != kronecker) {
1797 fprintf(stderr, "legendre != kronecker; a = ");
1798 BN_print_fp(stderr, a);
1799 fprintf(stderr, ", b = ");
1800 BN_print_fp(stderr, b);
1801 fprintf(stderr, "\n");
1824 int test_sqrt(BIO *bp, BN_CTX *ctx)
1834 if (a == NULL || p == NULL || r == NULL)
1837 BN_GENCB_set(&cb, genprime_cb, NULL);
1839 for (i = 0; i < 16; i++) {
1841 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 };
1843 if (!BN_set_word(p, primes[i]))
1846 if (!BN_set_word(a, 32))
1848 if (!BN_set_word(r, 2 * i + 1))
1851 if (!BN_generate_prime_ex(p, 256, 0, a, r, &cb))
1855 p->neg = rand_neg();
1857 for (j = 0; j < num2; j++) {
1859 * construct 'a' such that it is a square modulo p, but in
1860 * general not a proper square and not reduced modulo p
1862 if (!BN_bntest_rand(r, 256, 0, 3))
1864 if (!BN_nnmod(r, r, p, ctx))
1866 if (!BN_mod_sqr(r, r, p, ctx))
1868 if (!BN_bntest_rand(a, 256, 0, 3))
1870 if (!BN_nnmod(a, a, p, ctx))
1872 if (!BN_mod_sqr(a, a, p, ctx))
1874 if (!BN_mul(a, a, r, ctx))
1877 if (!BN_sub(a, a, p))
1880 if (!BN_mod_sqrt(r, a, p, ctx))
1882 if (!BN_mod_sqr(r, r, p, ctx))
1885 if (!BN_nnmod(a, a, p, ctx))
1888 if (BN_cmp(a, r) != 0) {
1889 fprintf(stderr, "BN_mod_sqrt failed: a = ");
1890 BN_print_fp(stderr, a);
1891 fprintf(stderr, ", r = ");
1892 BN_print_fp(stderr, r);
1893 fprintf(stderr, ", p = ");
1894 BN_print_fp(stderr, p);
1895 fprintf(stderr, "\n");
1917 int test_small_prime(BIO *bp, BN_CTX *ctx)
1919 static const int bits = 10;
1924 if (!BN_generate_prime_ex(r, bits, 0, NULL, NULL, NULL))
1926 if (BN_num_bits(r) != bits) {
1927 BIO_printf(bp, "Expected %d bit prime, got %d bit number\n", bits,
1939 #ifndef OPENSSL_SYS_WIN32
1940 int test_probable_prime_coprime(BIO *bp, BN_CTX *ctx)
1944 BN_ULONG primes[5] = { 2, 3, 5, 7, 11 };
1948 for (i = 0; i < 1000; i++) {
1949 if (!bn_probable_prime_dh_coprime(r, 1024, ctx))
1952 for (j = 0; j < 5; j++) {
1953 if (BN_mod_word(r, primes[j]) == 0) {
1954 BIO_printf(bp, "Number generated is not coprime to %ld:\n",
1956 BN_print_fp(stdout, r);
1957 BIO_printf(bp, "\n");
1970 int test_lshift(BIO *bp, BN_CTX *ctx, BIGNUM *a_)
1972 BIGNUM *a, *b, *c, *d;
1984 BN_bntest_rand(a, 200, 0, 0);
1985 a->neg = rand_neg();
1987 for (i = 0; i < num0; i++) {
1988 BN_lshift(b, a, i + 1);
1993 BIO_puts(bp, " * ");
1995 BIO_puts(bp, " - ");
2000 BN_mul(d, a, c, ctx);
2002 if (!BN_is_zero(d)) {
2003 fprintf(stderr, "Left shift test failed!\n");
2004 fprintf(stderr, "a=");
2005 BN_print_fp(stderr, a);
2006 fprintf(stderr, "\nb=");
2007 BN_print_fp(stderr, b);
2008 fprintf(stderr, "\nc=");
2009 BN_print_fp(stderr, c);
2010 fprintf(stderr, "\nd=");
2011 BN_print_fp(stderr, d);
2012 fprintf(stderr, "\n");
2023 int test_lshift1(BIO *bp)
2032 BN_bntest_rand(a, 200, 0, 0);
2033 a->neg = rand_neg();
2034 for (i = 0; i < num0; i++) {
2039 BIO_puts(bp, " * 2");
2040 BIO_puts(bp, " - ");
2047 if (!BN_is_zero(a)) {
2048 fprintf(stderr, "Left shift one test failed!\n");
2060 int test_rshift(BIO *bp, BN_CTX *ctx)
2062 BIGNUM *a, *b, *c, *d, *e;
2072 BN_bntest_rand(a, 200, 0, 0);
2073 a->neg = rand_neg();
2074 for (i = 0; i < num0; i++) {
2075 BN_rshift(b, a, i + 1);
2080 BIO_puts(bp, " / ");
2082 BIO_puts(bp, " - ");
2087 BN_div(d, e, a, c, ctx);
2089 if (!BN_is_zero(d)) {
2090 fprintf(stderr, "Right shift test failed!\n");
2102 int test_rshift1(BIO *bp)
2111 BN_bntest_rand(a, 200, 0, 0);
2112 a->neg = rand_neg();
2113 for (i = 0; i < num0; i++) {
2118 BIO_puts(bp, " / 2");
2119 BIO_puts(bp, " - ");
2126 if (!BN_is_zero(c) && !BN_abs_is_word(c, 1)) {
2127 fprintf(stderr, "Right shift one test failed!\n");
2140 static unsigned int neg = 0;
2141 static int sign[8] = { 0, 0, 0, 1, 1, 0, 1, 1 };
2143 return (sign[(neg++) % 8]);