Adapted test.c (SC_RSA_1_WITH_TESTS)

Author: czurnieden

bn_s_mp_div_recursive.c

@@ -1,5 +1,6 @@
 #include "tommath_private.h"
 #ifdef BN_S_MP_DIV_RECURSIVE_C
+
 /* LibTomMath, multiple-precision integer library -- Tom St Denis */
 /* SPDX-License-Identifier: Unlicense */
 
@@ -22,7 +23,7 @@ static mp_err s_mp_recursion(const mp_int *a, const mp_int *b, mp_int *q, mp_int
    mp_int A1, A2, B1, B0, Q1, Q0, R1, R0, t;
 
    m = a->used - b->used;
-   if (m < KARATSUBA_MUL_CUTOFF) {
+   if (m < MP_KARATSUBA_MUL_CUTOFF) {
       return s_mp_div_school(a, b, q, r);
    }
 
@@ -109,7 +110,7 @@ mp_err s_mp_div_recursive(const mp_int *a, const mp_int *b, mp_int *q, mp_int *r
 
        Vid. section 2.3.
     */
-   m = KARATSUBA_MUL_CUTOFF;
+   m = MP_KARATSUBA_MUL_CUTOFF;
    while (m <= b->used) {
       m <<= 1;
    }

bn_s_mp_div_school.c

@@ -2,6 +2,7 @@
 #ifdef BN_S_MP_DIV_SCHOOL_C
 /* LibTomMath, multiple-precision integer library -- Tom St Denis */
 /* SPDX-License-Identifier: Unlicense */
+
 #ifndef BN_MP_DIV_SMALL
 /* integer signed division.
  * c*b + d == a [e.g. a/b, c=quotient, d=remainder]

demo/test.c

@@ -2296,7 +2296,7 @@ static int test_s_mp_toom_sqr(void)
    mp_clear_multi(&a, &b, &c, NULL);
    return EXIT_FAILURE;
 }
-
+#ifndef BN_MP_DIV_SMALL
 /* Some larger values to test the fast divsion algorithm */
 static int test_s_mp_div(void)
 {
@@ -2370,7 +2370,7 @@ static int test_s_mp_div(void)
    mp_clear_multi(&a, &b, &c, &d, NULL);
    return EXIT_FAILURE;
 }
-
+#endif
 static int test_mp_read_write_ubin(void)
 {
    mp_int a, b, c;
@@ -2542,12 +2542,14 @@ static int unit_tests(int argc, char **argv)
       T1(mp_sqrt, MP_SQRT),
       T1(mp_sqrtmod_prime, MP_SQRTMOD_PRIME),
       T1(mp_xor, MP_XOR),
+#ifndef BN_MP_DIV_SMALL
+      T2(s_mp_div, S_MP_DIV_RECURSIVE, S_MP_DIV_SCHOOL),
+#endif
       T1(s_mp_balance_mul, S_MP_BALANCE_MUL),
       T1(s_mp_karatsuba_mul, S_MP_KARATSUBA_MUL),
       T1(s_mp_karatsuba_sqr, S_MP_KARATSUBA_SQR),
       T1(s_mp_toom_mul, S_MP_TOOM_MUL),
-      T1(s_mp_toom_sqr, S_MP_TOOM_SQR),
-      T1(s_mp_div, S_MP_DIV_RECURSIVE)
+      T1(s_mp_toom_sqr, S_MP_TOOM_SQR)
 #undef T2
 #undef T1
    };