Use 20 Miller-Rabin iterations regardless of the size of the integer. This

provides a much better worst-case error bound. Also take the nonce from anywhere
in the usable range rather than limiting the bit size.

1 files changed, 1 insertions, 1 deletions

diff --git a/src/lib/math/bigint/bigint.h b/src/lib/math/bigint/bigint.h
index a1164bf92..0d9b43357 100644
--- a/src/lib/math/bigint/bigint.h
+++ b/src/lib/math/bigint/bigint.h
@@ -430,7 +430,7 @@ class BOTAN_DLL BigInt
      * @param rng a random number generator
      * @param min the minimum value
      * @param max the maximum value
-     * @return random integer between min and max
+     * @return random integer in [min,max)
      */
      static BigInt random_integer(RandomNumberGenerator& rng,
                                   const BigInt& min,