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

[catacomb] / math / ec-info.c

diff --git a/math/ec-info.c b/math/ec-info.c
index 21d21fd..017c498 100644 (file)
--- a/math/ec-info.c
+++ b/math/ec-info.c
@@ -90,7 +90,7 @@
  *
  *   2. For each divisor %$d$% of %$r - 1$% less than %$B$% (which we can
  *     construct using this factorization), make sure that
- *      %$p^d \not\equiv 1 \pmod{r}$%.
+ *     %$p^d \not\equiv 1 \pmod{r}$%.
  *
  * This takes a little while but not ever-so long.
  *
@@ -112,13 +112,13 @@
  * References:
  *
  * [Hitt]  L. Hitt, On an improved definition of embedding degree;
- *         http://eprint.iacr.org/2006/415
+ *        http://eprint.iacr.org/2006/415
  *
  * [P1363] IEEE 1363-2000: Standard Specifications for Public Key
- *         Cryptography; http://grouper.ieee.org/groups/1363/P1363/index.html
+ *        Cryptography; http://grouper.ieee.org/groups/1363/P1363/index.html
  *
  * [SEC1]  SEC 1: Elliptic Curve Cryptography;
- *         http://www.secg.org/download/aid-385/sec1_final.pdf
+ *        http://www.secg.org/download/aid-385/sec1_final.pdf
  */
 
 /* --- @movcheck@ --- *