Changes for version 0.04
- Change from random_maurer_prime to random_nbit_prime. This is much faster and yields more possible primes (Maurer's algorithm only outputs about 10% of possible primes in the range). The downside is that the primes are not proven prime, however they will have passed a strong BPSW test and a set of Miller-Rabin tests for the first 46 prime bases. The BPSW test alone is really enough for these sizes (~600 digits or smaller).
- Ask for Math::BigInt 1.78 to ensure we have 'try'. Thanks to brian carlson.
- Reduce key sizes in 06 and 11 when not using GMP or Pari. Some build systems were timing out (e.g. ActiveState).
Modules
RSA public-key cryptosystem, using Math::BigInt