[thirdparty/openssl.git] / test / exptest.c

/*
 * Copyright 1995-2021 The OpenSSL Project Authors. All Rights Reserved.
 *
 * Licensed under the Apache License 2.0 (the "License").  You may not use
 * this file except in compliance with the License.  You can obtain a copy
 * in the file LICENSE in the source distribution or at
 * https://www.openssl.org/source/license.html
 */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "internal/nelem.h"

#include <openssl/bio.h>
#include <openssl/bn.h>
#include <openssl/rand.h>
#include <openssl/err.h>

#include "testutil.h"

#define NUM_BITS        (BN_BITS2 * 4)

#define BN_print_var(v) test_output_bignum(#v, v)

/*
 * Test that r == 0 in test_exp_mod_zero(). Returns one on success,
 * returns zero and prints debug output otherwise.
 */
static int a_is_zero_mod_one(const char *method, const BIGNUM *r,
                             const BIGNUM *a)
{
    if (!BN_is_zero(r)) {
        TEST_error("%s failed: a ** 0 mod 1 = r (should be 0)", method);
        BN_print_var(a);
        BN_print_var(r);
        return 0;
    }
    return 1;
}

/*
 * test_mod_exp_zero tests that x**0 mod 1 == 0. It returns zero on success.
 */
static int test_mod_exp_zero(void)
{
    BIGNUM *a = NULL, *p = NULL, *m = NULL;
    BIGNUM *r = NULL;
    BN_ULONG one_word = 1;
    BN_CTX *ctx = BN_CTX_new();
    int ret = 1, failed = 0;

    if (!TEST_ptr(m = BN_new())
        || !TEST_ptr(a = BN_new())
        || !TEST_ptr(p = BN_new())
        || !TEST_ptr(r = BN_new()))
        goto err;

    BN_one(m);
    BN_one(a);
    BN_zero(p);

    if (!TEST_true(BN_rand(a, 1024, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY)))
        goto err;

    if (!TEST_true(BN_mod_exp(r, a, p, m, ctx)))
        goto err;

    if (!TEST_true(a_is_zero_mod_one("BN_mod_exp", r, a)))
        failed = 1;

    if (!TEST_true(BN_mod_exp_recp(r, a, p, m, ctx)))
        goto err;

    if (!TEST_true(a_is_zero_mod_one("BN_mod_exp_recp", r, a)))
        failed = 1;

    if (!TEST_true(BN_mod_exp_simple(r, a, p, m, ctx)))
        goto err;

    if (!TEST_true(a_is_zero_mod_one("BN_mod_exp_simple", r, a)))
        failed = 1;

    if (!TEST_true(BN_mod_exp_mont(r, a, p, m, ctx, NULL)))
        goto err;

    if (!TEST_true(a_is_zero_mod_one("BN_mod_exp_mont", r, a)))
        failed = 1;

    if (!TEST_true(BN_mod_exp_mont_consttime(r, a, p, m, ctx, NULL)))
        goto err;

    if (!TEST_true(a_is_zero_mod_one("BN_mod_exp_mont_consttime", r, a)))
        failed = 1;

    /*
     * A different codepath exists for single word multiplication
     * in non-constant-time only.
     */
    if (!TEST_true(BN_mod_exp_mont_word(r, one_word, p, m, ctx, NULL)))
        goto err;

    if (!TEST_BN_eq_zero(r)) {
        TEST_error("BN_mod_exp_mont_word failed: "
                   "1 ** 0 mod 1 = r (should be 0)");
        BN_print_var(r);
        goto err;
    }

    ret = !failed;
 err:
    BN_free(r);
    BN_free(a);
    BN_free(p);
    BN_free(m);
    BN_CTX_free(ctx);

    return ret;
}

static int test_mod_exp(int round)
{
    BN_CTX *ctx;
    unsigned char c;
    int ret = 0;
    BIGNUM *r_mont = NULL;
    BIGNUM *r_mont_const = NULL;
    BIGNUM *r_recp = NULL;
    BIGNUM *r_simple = NULL;
    BIGNUM *a = NULL;
    BIGNUM *b = NULL;
    BIGNUM *m = NULL;

    if (!TEST_ptr(ctx = BN_CTX_new()))
        goto err;

    if (!TEST_ptr(r_mont = BN_new())
        || !TEST_ptr(r_mont_const = BN_new())
        || !TEST_ptr(r_recp = BN_new())
        || !TEST_ptr(r_simple = BN_new())
        || !TEST_ptr(a = BN_new())
        || !TEST_ptr(b = BN_new())
        || !TEST_ptr(m = BN_new()))
        goto err;

    if (!TEST_true(RAND_bytes(&c, 1)))
        goto err;
    c = (c % BN_BITS) - BN_BITS2;
    if (!TEST_true(BN_rand(a, NUM_BITS + c, BN_RAND_TOP_ONE,
                           BN_RAND_BOTTOM_ANY)))
        goto err;

    if (!TEST_true(RAND_bytes(&c, 1)))
        goto err;
    c = (c % BN_BITS) - BN_BITS2;
    if (!TEST_true(BN_rand(b, NUM_BITS + c, BN_RAND_TOP_ONE,
                           BN_RAND_BOTTOM_ANY)))
        goto err;

    if (!TEST_true(RAND_bytes(&c, 1)))
        goto err;
    c = (c % BN_BITS) - BN_BITS2;
    if (!TEST_true(BN_rand(m, NUM_BITS + c, BN_RAND_TOP_ONE,
                           BN_RAND_BOTTOM_ODD)))
        goto err;

    if (!TEST_true(BN_mod(a, a, m, ctx))
        || !TEST_true(BN_mod(b, b, m, ctx))
        || !TEST_true(BN_mod_exp_mont(r_mont, a, b, m, ctx, NULL))
        || !TEST_true(BN_mod_exp_recp(r_recp, a, b, m, ctx))
        || !TEST_true(BN_mod_exp_simple(r_simple, a, b, m, ctx))
        || !TEST_true(BN_mod_exp_mont_consttime(r_mont_const, a, b, m, ctx, NULL)))
        goto err;

    if (!TEST_BN_eq(r_simple, r_mont)
        || !TEST_BN_eq(r_simple, r_recp)
        || !TEST_BN_eq(r_simple, r_mont_const)) {
        if (BN_cmp(r_simple, r_mont) != 0)
            TEST_info("simple and mont results differ");
        if (BN_cmp(r_simple, r_mont_const) != 0)
            TEST_info("simple and mont const time results differ");
        if (BN_cmp(r_simple, r_recp) != 0)
            TEST_info("simple and recp results differ");

        BN_print_var(a);
        BN_print_var(b);
        BN_print_var(m);
        BN_print_var(r_simple);
        BN_print_var(r_recp);
        BN_print_var(r_mont);
        BN_print_var(r_mont_const);
        goto err;
    }

    ret = 1;
 err:
    BN_free(r_mont);
    BN_free(r_mont_const);
    BN_free(r_recp);
    BN_free(r_simple);
    BN_free(a);
    BN_free(b);
    BN_free(m);
    BN_CTX_free(ctx);

    return ret;
}

static int test_mod_exp_x2(int idx)
{
    BN_CTX *ctx;
    int ret = 0;
    BIGNUM *r_mont_const_x2_1 = NULL;
    BIGNUM *r_mont_const_x2_2 = NULL;
    BIGNUM *r_simple1 = NULL;
    BIGNUM *r_simple2 = NULL;
    BIGNUM *a1 = NULL;
    BIGNUM *b1 = NULL;
    BIGNUM *m1 = NULL;
    BIGNUM *a2 = NULL;
    BIGNUM *b2 = NULL;
    BIGNUM *m2 = NULL;
    int factor_size = 0;

    /*
     * Currently only 1024-bit factor size is supported.
     */
    if (idx <= 100)
        factor_size = 1024;

    if (!TEST_ptr(ctx = BN_CTX_new()))
        goto err;

    if (!TEST_ptr(r_mont_const_x2_1 = BN_new())
        || !TEST_ptr(r_mont_const_x2_2 = BN_new())
        || !TEST_ptr(r_simple1 = BN_new())
        || !TEST_ptr(r_simple2 = BN_new())
        || !TEST_ptr(a1 = BN_new())
        || !TEST_ptr(b1 = BN_new())
        || !TEST_ptr(m1 = BN_new())
        || !TEST_ptr(a2 = BN_new())
        || !TEST_ptr(b2 = BN_new())
        || !TEST_ptr(m2 = BN_new()))
        goto err;

    BN_rand(a1, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY);
    BN_rand(b1, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY);
    BN_rand(m1, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ODD);
    BN_rand(a2, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY);
    BN_rand(b2, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY);
    BN_rand(m2, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ODD);

    if (!TEST_true(BN_mod(a1, a1, m1, ctx))
        || !TEST_true(BN_mod(b1, b1, m1, ctx))
        || !TEST_true(BN_mod(a2, a2, m2, ctx))
        || !TEST_true(BN_mod(b2, b2, m2, ctx))
        || !TEST_true(BN_mod_exp_simple(r_simple1, a1, b1, m1, ctx))
        || !TEST_true(BN_mod_exp_simple(r_simple2, a2, b2, m2, ctx))
        || !TEST_true(BN_mod_exp_mont_consttime_x2(r_mont_const_x2_1, a1, b1, m1, NULL,
                                                   r_mont_const_x2_2, a2, b2, m2, NULL,
                                                   ctx)))
        goto err;

    if (!TEST_BN_eq(r_simple1, r_mont_const_x2_1)
        || !TEST_BN_eq(r_simple2, r_mont_const_x2_2)) {
        if (BN_cmp(r_simple1, r_mont_const_x2_1) != 0)
            TEST_info("simple and mont const time x2 (#1) results differ");
        if (BN_cmp(r_simple2, r_mont_const_x2_2) != 0)
            TEST_info("simple and mont const time x2 (#2) results differ");

        BN_print_var(a1);
        BN_print_var(b1);
        BN_print_var(m1);
        BN_print_var(a2);
        BN_print_var(b2);
        BN_print_var(m2);
        BN_print_var(r_simple1);
        BN_print_var(r_simple2);
        BN_print_var(r_mont_const_x2_1);
        BN_print_var(r_mont_const_x2_2);
        goto err;
    }

    ret = 1;
 err:
    BN_free(r_mont_const_x2_1);
    BN_free(r_mont_const_x2_2);
    BN_free(r_simple1);
    BN_free(r_simple2);
    BN_free(a1);
    BN_free(b1);
    BN_free(m1);
    BN_free(a2);
    BN_free(b2);
    BN_free(m2);
    BN_CTX_free(ctx);

    return ret;
}

int setup_tests(void)
{
    ADD_TEST(test_mod_exp_zero);
    ADD_ALL_TESTS(test_mod_exp, 200);
    ADD_ALL_TESTS(test_mod_exp_x2, 100);
    return 1;
}
Commit	Line	Data
440e5d80	1	/*
3c2bdd7d	2	* Copyright 1995-2021 The OpenSSL Project Authors. All Rights Reserved.
d02b48c6	3	*
909f1a2e	4	* Licensed under the Apache License 2.0 (the "License"). You may not use
440e5d80 RS	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 RE	8	*/
	9
	10	#include <stdio.h>
	11	#include <stdlib.h>
	12	#include <string.h>
55f78baf	13
176db6dc	14	#include "internal/nelem.h"
55f78baf	15
ec577822 BM	16	#include <openssl/bio.h>
	17	#include <openssl/bn.h>
	18	#include <openssl/rand.h>
	19	#include <openssl/err.h>
d02b48c6	20
58e754fc RS	21	#include "testutil.h"
58e754fc RS	22
94af0cd7	23	#define NUM_BITS (BN_BITS2 * 4)
0f113f3e	24
37916462	25	#define BN_print_var(v) test_output_bignum(#v, v)
0f113f3e	26
d911097d EK	27	/*
	28	* Test that r == 0 in test_exp_mod_zero(). Returns one on success,
	29	* returns zero and prints debug output otherwise.
	30	*/
	31	static int a_is_zero_mod_one(const char method, const BIGNUM r,
58e754fc RS	32	const BIGNUM *a)
58e754fc RS	33	{
d911097d	34	if (!BN_is_zero(r)) {
37916462	35	TEST_error("%s failed: a ** 0 mod 1 = r (should be 0)", method);
58e754fc RS	36	BN_print_var(a);
58e754fc RS	37	BN_print_var(r);
d911097d EK	38	return 0;
	39	}
	40	return 1;
	41	}
	42
0f113f3e	43	/*
58e754fc	44	* test_mod_exp_zero tests that x**0 mod 1 == 0. It returns zero on success.
0f113f3e	45	*/
31a80694	46	static int test_mod_exp_zero(void)
0f113f3e MC	47	{
	48	BIGNUM a = NULL, p = NULL, *m = NULL;
	49	BIGNUM *r = NULL;
d911097d	50	BN_ULONG one_word = 1;
0f113f3e	51	BN_CTX *ctx = BN_CTX_new();
d911097d	52	int ret = 1, failed = 0;
0f113f3e	53
58e754fc RS	54	if (!TEST_ptr(m = BN_new())
	55	\|\| !TEST_ptr(a = BN_new())
	56	\|\| !TEST_ptr(p = BN_new())
	57	\|\| !TEST_ptr(r = BN_new()))
0f113f3e	58	goto err;
0f113f3e	59
58e754fc	60	BN_one(m);
0f113f3e	61	BN_one(a);
0f113f3e MC	62	BN_zero(p);
0f113f3e MC	63
58e754fc	64	if (!TEST_true(BN_rand(a, 1024, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY)))
d911097d EK	65	goto err;
d911097d EK	66
58e754fc	67	if (!TEST_true(BN_mod_exp(r, a, p, m, ctx)))
d911097d EK	68	goto err;
d911097d EK	69
58e754fc	70	if (!TEST_true(a_is_zero_mod_one("BN_mod_exp", r, a)))
d911097d EK	71	failed = 1;
d911097d EK	72
58e754fc	73	if (!TEST_true(BN_mod_exp_recp(r, a, p, m, ctx)))
d911097d EK	74	goto err;
d911097d EK	75
58e754fc	76	if (!TEST_true(a_is_zero_mod_one("BN_mod_exp_recp", r, a)))
d911097d EK	77	failed = 1;
d911097d EK	78
58e754fc	79	if (!TEST_true(BN_mod_exp_simple(r, a, p, m, ctx)))
d911097d EK	80	goto err;
d911097d EK	81
58e754fc	82	if (!TEST_true(a_is_zero_mod_one("BN_mod_exp_simple", r, a)))
d911097d EK	83	failed = 1;
d911097d EK	84
58e754fc	85	if (!TEST_true(BN_mod_exp_mont(r, a, p, m, ctx, NULL)))
d911097d EK	86	goto err;
d911097d EK	87
58e754fc	88	if (!TEST_true(a_is_zero_mod_one("BN_mod_exp_mont", r, a)))
d911097d EK	89	failed = 1;
d911097d EK	90
58e754fc	91	if (!TEST_true(BN_mod_exp_mont_consttime(r, a, p, m, ctx, NULL)))
d911097d	92	goto err;
0f113f3e	93
58e754fc	94	if (!TEST_true(a_is_zero_mod_one("BN_mod_exp_mont_consttime", r, a)))
d911097d EK	95	failed = 1;
	96
	97	/*
	98	* A different codepath exists for single word multiplication
	99	* in non-constant-time only.
	100	*/
58e754fc	101	if (!TEST_true(BN_mod_exp_mont_word(r, one_word, p, m, ctx, NULL)))
d911097d EK	102	goto err;
d911097d EK	103
dc352c19	104	if (!TEST_BN_eq_zero(r)) {
37916462 P	105	TEST_error("BN_mod_exp_mont_word failed: "
37916462 P	106	"1 ** 0 mod 1 = r (should be 0)");
58e754fc RS	107	BN_print_var(r);
58e754fc RS	108	goto err;
d911097d EK	109	}
d911097d EK	110
58e754fc	111	ret = !failed;
0f113f3e MC	112	err:
	113	BN_free(r);
	114	BN_free(a);
	115	BN_free(p);
	116	BN_free(m);
d911097d	117	BN_CTX_free(ctx);
0f113f3e MC	118
0f113f3e MC	119	return ret;
2b0180c3 AL	120	}
2b0180c3 AL	121
58e754fc	122	static int test_mod_exp(int round)
0f113f3e MC	123	{
0f113f3e MC	124	BN_CTX *ctx;
0f113f3e	125	unsigned char c;
58e754fc RS	126	int ret = 0;
	127	BIGNUM *r_mont = NULL;
	128	BIGNUM *r_mont_const = NULL;
	129	BIGNUM *r_recp = NULL;
	130	BIGNUM *r_simple = NULL;
	131	BIGNUM *a = NULL;
	132	BIGNUM *b = NULL;
	133	BIGNUM *m = NULL;
	134
	135	if (!TEST_ptr(ctx = BN_CTX_new()))
	136	goto err;
	137
	138	if (!TEST_ptr(r_mont = BN_new())
	139	\|\| !TEST_ptr(r_mont_const = BN_new())
	140	\|\| !TEST_ptr(r_recp = BN_new())
	141	\|\| !TEST_ptr(r_simple = BN_new())
	142	\|\| !TEST_ptr(a = BN_new())
	143	\|\| !TEST_ptr(b = BN_new())
	144	\|\| !TEST_ptr(m = BN_new()))
0f113f3e MC	145	goto err;
0f113f3e MC	146
0d2b8bd2 P	147	if (!TEST_true(RAND_bytes(&c, 1)))
0d2b8bd2 P	148	goto err;
58e754fc	149	c = (c % BN_BITS) - BN_BITS2;
0d2b8bd2 P	150	if (!TEST_true(BN_rand(a, NUM_BITS + c, BN_RAND_TOP_ONE,
	151	BN_RAND_BOTTOM_ANY)))
	152	goto err;
58e754fc	153
0d2b8bd2 P	154	if (!TEST_true(RAND_bytes(&c, 1)))
0d2b8bd2 P	155	goto err;
58e754fc	156	c = (c % BN_BITS) - BN_BITS2;
0d2b8bd2 P	157	if (!TEST_true(BN_rand(b, NUM_BITS + c, BN_RAND_TOP_ONE,
	158	BN_RAND_BOTTOM_ANY)))
	159	goto err;
58e754fc	160
0d2b8bd2 P	161	if (!TEST_true(RAND_bytes(&c, 1)))
0d2b8bd2 P	162	goto err;
58e754fc	163	c = (c % BN_BITS) - BN_BITS2;
0d2b8bd2 P	164	if (!TEST_true(BN_rand(m, NUM_BITS + c, BN_RAND_TOP_ONE,
	165	BN_RAND_BOTTOM_ODD)))
	166	goto err;
58e754fc	167
9e206ce5 P	168	if (!TEST_true(BN_mod(a, a, m, ctx))
	169	\|\| !TEST_true(BN_mod(b, b, m, ctx))
	170	\|\| !TEST_true(BN_mod_exp_mont(r_mont, a, b, m, ctx, NULL))
58e754fc RS	171	\|\| !TEST_true(BN_mod_exp_recp(r_recp, a, b, m, ctx))
	172	\|\| !TEST_true(BN_mod_exp_simple(r_simple, a, b, m, ctx))
	173	\|\| !TEST_true(BN_mod_exp_mont_consttime(r_mont_const, a, b, m, ctx, NULL)))
	174	goto err;
	175
dc352c19 P	176	if (!TEST_BN_eq(r_simple, r_mont)
	177	\|\| !TEST_BN_eq(r_simple, r_recp)
	178	\|\| !TEST_BN_eq(r_simple, r_mont_const)) {
58e754fc	179	if (BN_cmp(r_simple, r_mont) != 0)
dc352c19	180	TEST_info("simple and mont results differ");
58e754fc	181	if (BN_cmp(r_simple, r_mont_const) != 0)
dc352c19	182	TEST_info("simple and mont const time results differ");
58e754fc	183	if (BN_cmp(r_simple, r_recp) != 0)
dc352c19	184	TEST_info("simple and recp results differ");
58e754fc RS	185
	186	BN_print_var(a);
	187	BN_print_var(b);
	188	BN_print_var(m);
	189	BN_print_var(r_simple);
	190	BN_print_var(r_recp);
	191	BN_print_var(r_mont);
	192	BN_print_var(r_mont_const);
	193	goto err;
0f113f3e	194	}
58e754fc RS	195
	196	ret = 1;
	197	err:
0f113f3e MC	198	BN_free(r_mont);
	199	BN_free(r_mont_const);
	200	BN_free(r_recp);
	201	BN_free(r_simple);
	202	BN_free(a);
	203	BN_free(b);
	204	BN_free(m);
	205	BN_CTX_free(ctx);
8793f012	206
58e754fc RS	207	return ret;
58e754fc RS	208	}
0f113f3e	209
c781eb1c AM	210	static int test_mod_exp_x2(int idx)
	211	{
	212	BN_CTX *ctx;
	213	int ret = 0;
	214	BIGNUM *r_mont_const_x2_1 = NULL;
	215	BIGNUM *r_mont_const_x2_2 = NULL;
	216	BIGNUM *r_simple1 = NULL;
	217	BIGNUM *r_simple2 = NULL;
	218	BIGNUM *a1 = NULL;
	219	BIGNUM *b1 = NULL;
	220	BIGNUM *m1 = NULL;
	221	BIGNUM *a2 = NULL;
	222	BIGNUM *b2 = NULL;
	223	BIGNUM *m2 = NULL;
	224	int factor_size = 0;
	225
	226	/*
	227	* Currently only 1024-bit factor size is supported.
	228	*/
	229	if (idx <= 100)
	230	factor_size = 1024;
	231
	232	if (!TEST_ptr(ctx = BN_CTX_new()))
	233	goto err;
	234
	235	if (!TEST_ptr(r_mont_const_x2_1 = BN_new())
	236	\|\| !TEST_ptr(r_mont_const_x2_2 = BN_new())
	237	\|\| !TEST_ptr(r_simple1 = BN_new())
	238	\|\| !TEST_ptr(r_simple2 = BN_new())
	239	\|\| !TEST_ptr(a1 = BN_new())
	240	\|\| !TEST_ptr(b1 = BN_new())
	241	\|\| !TEST_ptr(m1 = BN_new())
	242	\|\| !TEST_ptr(a2 = BN_new())
	243	\|\| !TEST_ptr(b2 = BN_new())
	244	\|\| !TEST_ptr(m2 = BN_new()))
	245	goto err;
	246
	247	BN_rand(a1, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY);
	248	BN_rand(b1, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY);
	249	BN_rand(m1, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ODD);
	250	BN_rand(a2, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY);
	251	BN_rand(b2, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY);
	252	BN_rand(m2, factor_size, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ODD);
	253
	254	if (!TEST_true(BN_mod(a1, a1, m1, ctx))
	255	\|\| !TEST_true(BN_mod(b1, b1, m1, ctx))
	256	\|\| !TEST_true(BN_mod(a2, a2, m2, ctx))
	257	\|\| !TEST_true(BN_mod(b2, b2, m2, ctx))
	258	\|\| !TEST_true(BN_mod_exp_simple(r_simple1, a1, b1, m1, ctx))
	259	\|\| !TEST_true(BN_mod_exp_simple(r_simple2, a2, b2, m2, ctx))
	260	\|\| !TEST_true(BN_mod_exp_mont_consttime_x2(r_mont_const_x2_1, a1, b1, m1, NULL,
	261	r_mont_const_x2_2, a2, b2, m2, NULL,
	262	ctx)))
	263	goto err;
	264
	265	if (!TEST_BN_eq(r_simple1, r_mont_const_x2_1)
	266	\|\| !TEST_BN_eq(r_simple2, r_mont_const_x2_2)) {
	267	if (BN_cmp(r_simple1, r_mont_const_x2_1) != 0)
	268	TEST_info("simple and mont const time x2 (#1) results differ");
	269	if (BN_cmp(r_simple2, r_mont_const_x2_2) != 0)
	270	TEST_info("simple and mont const time x2 (#2) results differ");
	271
	272	BN_print_var(a1);
	273	BN_print_var(b1);
274	BN_print_var(m1);
275	BN_print_var(a2);
276	BN_print_var(b2);
277	BN_print_var(m2);
278	BN_print_var(r_simple1);
279	BN_print_var(r_simple2);
280	BN_print_var(r_mont_const_x2_1);
281	BN_print_var(r_mont_const_x2_2);
282	goto err;
283	}
284
285	ret = 1;
286	err:
287	BN_free(r_mont_const_x2_1);
288	BN_free(r_mont_const_x2_2);
289	BN_free(r_simple1);
290	BN_free(r_simple2);
291	BN_free(a1);
292	BN_free(b1);
293	BN_free(m1);
294	BN_free(a2);
295	BN_free(b2);
296	BN_free(m2);
297	BN_CTX_free(ctx);
298
299	return ret;
300	}
301
ad887416	302	int setup_tests(void)
58e754fc RS	303	{
	304	ADD_TEST(test_mod_exp_zero);
	305	ADD_ALL_TESTS(test_mod_exp, 200);
c781eb1c	306	ADD_ALL_TESTS(test_mod_exp_x2, 100);
ad887416	307	return 1;
0f113f3e	308	}