test with high short product

Author: czurnieden

s_mp_faster_to_radix.c

@@ -64,7 +64,8 @@ static mp_err s_mp_to_radix_recursive(const mp_int *a, char **str, size_t *part_
          /* TODO: we don't need the full "a" only  the upper part: a = a_1\beta + a_0 with 0 < a_0 < \beta
                  (high short-product with s_mp_mul_high).
                  Problem: s_mp_mul_high does not make use of fast multiplication except COMBA.
-                 (You can do it with Toom-Cook algorithms, but that is work for another day.) */
+                 (You can do it with Toom-Cook algorithms, but that is work for another day.) */#
+         /*if( (err = s_mp_mul_high(a, &R[t], &q, (a->used/2) + 1) ) != MP_OKAY)                           goto LTM_ERR;*/
          if ((err = mp_mul(a, &R[t], &q)) != MP_OKAY)                                                    goto LTM_ERR;
          if ((err = mp_div_2d(&q, Beta, &q, NULL)) != MP_OKAY)                                           goto LTM_ERR;