Additional tests with large SPSPs to multiple bases.

Author: czurnieden

demo/test.c

@@ -883,7 +883,7 @@ static int test_mp_prime_rand(void)
 
    /* test for size */
    for (ix = 10; ix < 128; ix++) {
-      printf("Testing (not safe-prime): %9d bits    \n", ix);
+      printf("\rTesting (not safe-prime): %9d bits    ", ix);
       fflush(stdout);
       DO(mp_prime_rand(&a, 8, ix, (rand_int() & 1) ? 0 : MP_PRIME_2MSB_ON));
       EXPECT(mp_count_bits(&a) == ix);
@@ -912,15 +912,20 @@ static const uint32_t SPSP_3[] = {
 };
 
 /* SPSP to all bases < 100 */
-/* still needs computing
-static const char *SPSP_2_100_LARGE[] = {
-   "",
-   "",
-   "",
-   "",
-   ""
+static const char *SPSP_2_100_LARGE[4] = {
+   "3L2x7YRmz7g4q+DwxESBacAClxrNiuspLCf8BUEphtky+5VNHLAb2ZZLLI0bu6cAOtNkUXenakBCCL"
+   "Vn7gqOpkcrQ/ptxZdk+4gnI99wFjgcfM512N71ZzbwvLe+5Pzat2k+nHIjE0w/WbQvzk4a2/syAY8S"
+   "i1B5XRjXYVAQOLyNWhsFpXeWXUgqiNzv7avfwBA3ZOXt", /* bases 2 - 100 */
+   "JOcSIwxGqGEjeQ2GsdlnFMwhc+xY7EtZo5Kf4BglOuakxTJaP8qrdZyduXaAZUdzyPgQLf7B8vqvVE"
+   "VLJwH7dLkLEiw19tfu3naT6DgQWzk+b5WuwWJzsTMdgWWH86M1h/Gjt2J/qABtTTH26C8bS4v/q9Fh"
+   "R8jqHNOiufUgHkDQdW9Z+BLlf6OVVh2VwPIOGVc7kFF",  /* bases 2 - 107 */
+   "1ZCddPKHO7yeqI5ZeKG5ssTnzJeIDpWElJEZnHwejl4tsyly44JgwdiRmXgsi9FQfYhMzFZMgV6qWZZ"
+   "sIJl4RNgpD/PDb3nam++ECkzMBuNIXVpmZzw+Gj5xQmpKK+OX8pFSy2IQiKyKAOfSaivXEb2/dga2J/"
+   "Pc2d23lw+eP3WtBbfHc7TAQGgNI/6Xmcpl1G64eXCrJ",  /* bases 2 - 103 */
+   "cCax282DurA+2Z54W3VLKSC2mwgpilQpGydCDHvXHNRKbJQRa5NtLLfa3sXvCmUWZ9okP2ZSsPDnw0X"
+   "dUQLzaz59vnw0rKbfsoA4nDBjMXR78Q889+KS4HFKfXkzxsiIKYo0kSfwPKYxFUi4Zj185kwwAPTAr2"
+   "IjegdWjQLeX1ZQM0HVUUF3WEVhHXcFzF0sMiJU5hl"     /* bases 2 - 101 */
 };
-*/
 
 /* Extra strong Lucas test with Baillie's parameters Q = 1, P = 3 */
 static const uint32_t ESLPSP[] =  {
@@ -940,7 +945,7 @@ static const uint32_t AESLPSP[] = {
    4269341, 5192309, 7045433, 7226669, 7265561
 };
 
-/* Some randomly choosen 200 decimal digits large primes (https://primes.utm.edu/lists/small/small2.html) */
+/* Some randomly choosen 200 decimal digit large primes (https://primes.utm.edu/lists/small/small2.html) */
 static const char *medium_primes[10] = {
    "C8Ckh0vviS3HUPdB1NSrSm+gOodw/f1aQ5+aaH1W6RMB0jVkO6lTaL54O3o7U5BSGUFGxm5gAvisbJamasuLZS8g3ZsJ2JM4Vtn9cQZRfkP6b8V",
    "64xDN9FqLBiovZ/9q/EPm0DONpIfn5MbJKHa+IjT0fjAzkg34FpAmad+CwhcpKaiTbZEpErut+DhpVyiQfqBFrgcGnGhhIrMF/XkyY3aVx6E96B",
@@ -961,6 +966,7 @@ static int test_mp_prime_miller_rabin(void)
    mp_int a, b, c;
    bool result;
    int i;
+   mp_digit j;
    DOR(mp_init_multi(&a, &b, &c, NULL));
 
    /* SPSP to base 2 */
@@ -998,6 +1004,35 @@ static int test_mp_prime_miller_rabin(void)
       EXPECT(result == true);
    }
 
+   /* SPSP to bases 2 -- 100 */
+   mp_set(&b, 2u);
+   for (i = 0; i < 4; i++) {
+      DO(mp_read_radix(&a, SPSP_2_100_LARGE[i], 64));
+      for (j = 2u; j <= 100u; j++) {
+         result = false;
+         mp_set(&b, j);
+         DO(mp_prime_miller_rabin(&a, &b, &result));
+         EXPECT(result == true);
+      }
+      /* 107 is a prime that works */
+      mp_set(&b, 107u);
+      DO(mp_prime_miller_rabin(&a, &b, &result));
+      EXPECT(result == false);
+   }
+
+   /* SPSP to bases 2 -- 100, automatic */
+   mp_set(&b, 2u);
+   for (i = 0; i < 4; i++) {
+      DO(mp_read_radix(&a, SPSP_2_100_LARGE[i], 64));
+      for (j = 2u; j <= (mp_digit)mp_prime_rabin_miller_trials(mp_count_bits(&a)); j++) {
+         result = false;
+         mp_set(&b, (mp_digit)s_mp_prime_tab[j]);
+         DO(mp_prime_miller_rabin(&a, &b, &result));
+      }
+      /* These numbers are not big enough for the heuristics to work */
+      EXPECT(result == true);
+   }
+
    mp_clear_multi(&a, &b, &c, NULL);
    return EXIT_SUCCESS;
 LBL_ERR:
@@ -1064,6 +1099,17 @@ static int test_mp_prime_is_prime(void)
    mp_int a, b;
    DOR(mp_init_multi(&a, &b, NULL));
 
+   /* strong Miller-Rabin pseudoprimes to the first 100 primes (gernerated with Arnault's method) */
+   printf("Testing mp_prime_is_prime() with SPSPs to the first 100 primes\n");
+   for (ix = 0; ix < 4; ix++) {
+      DO(mp_read_radix(&a,SPSP_2_100_LARGE[ix],64));
+      DO(mp_prime_is_prime(&a, mp_prime_rabin_miller_trials(mp_count_bits(&a)), &cnt));
+      if (cnt) {
+         printf("SPSP_2_100_LARGE[%d] is not prime but mp_prime_is_prime says it is.\n", ix);
+         goto LBL_ERR;
+      }
+   }
+
    /* strong Miller-Rabin pseudoprime to the first 200 primes (F. Arnault) */
    printf("Testing mp_prime_is_prime() with Arnault's pseudoprime  803...901");
    DO(mp_read_radix(&a,