math/strongprime.c: Reduce failures by adding some more slop bits.

In my experiments, failures were happening about 2--3% of the time,
which is way more than one is really willing to tolerate.

diff --git a/math/strongprime.c b/math/strongprime.c
index fc20bfea8077714b391b37dad61a74a64e8fa518..e88349259b7462fe9390cadb08fcc1a6105215de 100644 (file)
--- a/math/strongprime.c
+++ b/math/strongprime.c
@@ -87,11 +87,11 @@ mp *strongprime_setup(const char *name, mp *d, pfilt *f, unsigned nbits,
    * i.e., if %$J \le N - (k + \log_2 N)$%.
    *
    * Experimentation shows that taking %$k + \log_2 N = 12$% works well for
    * i.e., if %$J \le N - (k + \log_2 N)$%.
    *
    * Experimentation shows that taking %$k + \log_2 N = 12$% works well for

-   * %$N = 1024$%, so %$k = 2$%.
+   * %$N = 1024$%, so %$k = 2$%.  Add a few extra bits for luck.

    */
 
   for (i = 1; i && nbits >> i; i <<= 1); assert(i);
    */
 
   for (i = 1; i && nbits >> i; i <<= 1); assert(i);

-  for (slop = 2, nb = nbits; nb > 1; i >>= 1) {
+  for (slop = 6, nb = nbits; nb > 1; i >>= 1) {

     u = nb >> i;
     if (u) { slop += i; nb = u; }
   }
     u = nb >> i;
     if (u) { slop += i; nb = u; }
   }