1. 03 Feb, 2012 1 commit
  2. 01 Jun, 2010 1 commit
    • Niels Möller's avatar
      (_nettle_generate_pocklington_prime): New · cc12a87b
      Niels Möller authored
      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
      cc12a87b
  3. 26 May, 2010 2 commits
    • Niels Möller's avatar
      * bignum-random-prime.c (_nettle_generate_pocklington_prime): Also · 9c7f70fb
      Niels Möller authored
      return the used r. Updated caller.
      
      Rev: nettle/bignum-random-prime.c:1.5
      Rev: nettle/bignum.h:1.6
      9c7f70fb
    • Niels Möller's avatar
      (_nettle_generate_pocklington_prime): New · e480a2de
      Niels Möller authored
      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
      e480a2de
  4. 20 May, 2010 2 commits
  5. 09 Apr, 2010 1 commit