argument top_bits_set, to optionally generate primes with the two
most significant bits set. Reordered argument list.
(nettle_random_prime): Likewise, added top_bits_set argument.
Invoke progress callback when a prime is generated.

Rev: nettle/bignum-random-prime.c:1.6
Rev: nettle/bignum.h:1.7

return the used r. Updated caller.

Rev: nettle/bignum-random-prime.c:1.5
Rev: nettle/bignum.h:1.6

function. Rely on mpz_probab_prime_p (for lack of a trial division
function) for trial division.
(nettle_random_prime): Rewritten. Uses the prime table for the
smallest sizes, then trial division using a new set of tables, and
then Maurer's algorithm, calling the new
_nettle_generate_pocklington_prime for the final search.

Rev: nettle/ChangeLog:1.80
Rev: nettle/bignum-random-prime.c:1.4
Rev: nettle/bignum.h:1.5

Rev: nettle/bignum-random-prime.c:1.3

logic when Miller-rabin succeeds early.

Rev: nettle/ChangeLog:1.78
Rev: nettle/bignum-random-prime.c:1.2

* bignum-random-prime.c (nettle_random_prime): New file, new
function.

Rev: nettle/ChangeLog:1.75
Rev: nettle/Makefile.in:1.23
Rev: nettle/bignum-random-prime.c:1.1
Rev: nettle/bignum.h:1.4