/ 
Math-Prime-Util-0.62
River stage two • 13 direct dependents • 21 total dependents

Changes for version 0.62 - 2017-04-16

  • API Changes
    • The 'irand' config option is removed, as we now use our own CSPRNG. It can be seeded with csrand() or srand(). The latter is not exported.
    • The 'primeinc' config option is deprecated and will go away soon.
  • ADDED
    • irand() Returns uniform random 32-bit integer
    • irand64() Returns uniform random 64-bit integer
    • drand([fmax]) Returns uniform random NV (floating point)
    • urandomb(n) Returns uniform random integer less than 2^n
    • urandomm(n) Returns uniform random integer in [0, n-1]
    • random_bytes(nbytes) Return a string of CSPRNG bytes
    • csrand(data) Seed the CSPRNG
    • srand([UV]) Insecure seed for the CSPRNG (not exported)
    • entropy_bytes(nbytes) Returns data from our entropy source
    • :rand Exports srand, rand, irand, irand64
    • nth_ramanujan_prime_upper(n) Upper limit of nth Ramanujan prime
    • nth_ramanujan_prime_lower(n) Lower limit of nth Ramanujan prime
    • nth_ramanujan_prime_approx(n) Approximate nth Ramanujan prime
    • ramanujan_prime_count_upper(n) Upper limit of Ramanujan prime count
    • ramanujan_prime_count_lower(n) Lower limit of Ramanujan prime count
    • ramanujan_prime_count_approx(n) Approximate Ramanujan prime count
  • FUNCTIONALITY AND PERFORMANCE
    • vecsum is faster when returning a bigint from native inputs (we construct the 128-bit string in C, then call _to_bigint).
    • Add a simple Legendre prime sum using uint128_t, which means only for modern 64-bit compilers. It allows reasonably fast prime sums for larger inputs, e.g. 10^12 in 10 seconds. Kim Walisch's primesum is much more sophisticated and over 100x faster.
    • is_pillai about 10x faster for composites.
    • Much faster Ramanujan prime count and nth prime. These also now use vastly less memory even with large inputs.
    • small speed ups for cluster sieve.
    • faster PP is_semiprime.
    • Add prime option to forpart restrictions for all prime / non-prime.
    • is_primitive_root needs two args, as documented.
    • We do random seeding ourselves now, so remove dependency.
    • Random primes functions moved to XS / GMP, 3-10x faster.

Modules

Math::Prime::Util
Utilities related to prime numbers, including fast sieves and factoring
Math::Prime::Util::ChaCha
Pure Perl ChaCha20 CSPRNG
Math::Prime::Util::ECAffinePoint
Elliptic curve operations for affine points
Math::Prime::Util::ECProjectivePoint
Elliptic curve operations for projective points
Math::Prime::Util::Entropy
Get a good random seed
Math::Prime::Util::ISAAC
Pure Perl ISAAC CSPRNG
Math::Prime::Util::MemFree
An auto-free object for Math::Prime::Util
Math::Prime::Util::PP
Pure Perl version of Math::Prime::Util
Math::Prime::Util::PPFE
PP front end for Math::Prime::Util
Math::Prime::Util::PrimalityProving
Primality proofs and certificates
Math::Prime::Util::PrimeArray
A tied array for primes
Math::Prime::Util::PrimeIterator
An object iterator for primes
Math::Prime::Util::RandomPrimes
Generate random primes
Math::Prime::Util::ZetaBigFloat
Perl Big Float versions of Riemann Zeta and R functions
ntheory
Number theory utilities

Examples

Other files