Changes for version 0.26

  • Pure Perl factoring:
    • real p-1 -- much faster and more effective
    • Fermat (no better than HOLF)
    • speedup for pbrent
    • simple ECM
    • redo factoring mix
  • New functions: prime_certificate produces a certificate of primality. verify_prime checks a primality certificate.
  • Pure perl primality proof now uses BLS75 instead of Lucas, so some numbers will be much faster [n-1 only needs factoring to (n/2)^1/3].
  • Math::Prime::Util::ECAffinePoint and ECProjectivePoint modules for dealing with elliptic curves.

Modules

Utilities related to prime numbers, including fast sieves and factoring
Elliptic curve operations for affine points
Elliptic curve operations for projective points
An auto-free object for Math::Prime::Util
Pure Perl version of Math::Prime::Util
A tied array for primes
Perl Big Float versions of Riemann Zeta and R functions