Changes for version 0.43
- random_strong_prime(nbits) random strong prob prime of nbits bits
- random_maurer_prime(nbits) random nbits-bits proven prime
- random_shawe_taylor_prime(nbits) random nbits-bits proven prime
- random_maurer_prime_with_cert(nbits)
- random_shawe_taylor_prime_with_cert(nbits)
- csprng_urandomb(n) random number between 0 and 2^n-1
- csprng_urandomr(lo,hi) random number in [lo,hi], inclusive.
- PERFORMANCE
- sieve_primes with small widths should perform much better.
Modules
Utilities related to prime numbers and factoring, using GMP