**Math::Primality - Check for primes with Perl**

Math::Primality implements is_prime() and next_prime() as a replacement for Math::PARI::is_prime(). It uses the GMP library through Math::GMPz. The is_prime() method is actually a Baillie-PSW primality test which consists of two steps: * Perform a st...

LETO/Math-Primality-0.08 - 01 Feb 2013 06:35:23 GMT - Search in distribution- Math::Primality::AKS - Check for primality using the AKS (Agrawal-Kayal-Saxena) algorithm
- Math::Primality::BigPolynomial - Big Polynomials
- primes.pl - Print all primes between the two integers
- 1 more result from Math-Primality ยป

**Math::Prime::Util::PrimalityProving - Primality proofs and certificates**

Routines to support primality proofs and certificate verification....

DANAJ/Math-Prime-Util-0.70 - 02 Dec 2017 23:49:46 GMT - Search in distribution- ntheory - Number theory utilities
- Math::Prime::Util - Utilities related to prime numbers, including fast sieves and factoring

**Math::GMPz - perl interface to the GMP library's integer (mpz) functions.**

A bignum module utilising the Gnu MP (GMP) library. Basically this module simply wraps nearly all of the integer functions provided by that library. The documentation below extensively plagiarises the documentation at http://gmplib.org. See the Math:...

SISYPHUS/Math-GMPz-0.48 - 20 Dec 2017 11:43:05 GMT - Search in distribution**Math::AnyNum - Arbitrary size precision for integers, rationals, floating-points and complex numbers.**

Math::AnyNum focuses primarily on providing a friendly interface and good performance. In most cases, it can be used as a drop-in replacement for the bignum and bigrat pragmas. The philosophy of Math::AnyNum is that mathematics should just work, ther...

TRIZEN/Math-AnyNum-0.22 - 17 Feb 2018 05:11:26 GMT - Search in distribution**Quantum::Superpositions - QM-like superpositions in Perl**

The Quantum::Superpositions module adds two new operators to Perl: "any" and "all". Each of these operators takes a list of values (states) and superimposes them into a single scalar value (a superposition), which can then be stored in a standard sca...

LEMBARK/Quantum-Superpositions-2.02 - 22 Apr 2003 22:56:27 GMT - Search in distribution**Crypt::DSA::GMP - DSA Signatures and Key Generation**

Crypt::DSA::GMP is an implementation of the DSA (Digital Signature Algorithm) signature verification system. The implementation itself is pure Perl, with mathematics support from Math::BigInt::GMP and Math::Prime::Util::GMP. This package provides DSA...

DANAJ/Crypt-DSA-GMP-0.02 - 08 Oct 2013 14:47:16 GMT - Search in distribution- Crypt::DSA::GMP::Key - DSA key

**Algorithm::BitVector - A memory efficient packed representation of arbitrary sized bit arrays and for logical and arithmetic operations on such arrays.**

My main motivation for creating this module was to provide the students at Purdue and elsewhere with a Perl class whose API is the same as that of my Python based "BitVector" module that appears to have become popular for prototyping algorithms for c...

AVIKAK/Algorithm-BitVector-1.26 - 15 Jan 2018 15:53:49 GMT - Search in distribution**Math::Prime::FastSieve - Generate a list of all primes less than or equal to $n. Do it quickly.**

This module provides an optimized implementation of the Sieve of Eratosthenes, and uses it to return a reference to an array all primes up to any integer specified, within the limitations of addressable memory. Additionally the module provides access...

DAVIDO/Math-Prime-FastSieve-0.19 - 27 Jul 2013 05:38:25 GMT - Search in distribution**Math::Prime::Util::GMP - Utilities related to prime numbers and factoring, using GMP**

A module for number theory in Perl using GMP. This includes primality tests, getting primes in a range, factoring, and more. While it certainly can be used directly, the main purpose of this module is for Math::Prime::Util. That module will automatic...

DANAJ/Math-Prime-Util-GMP-0.50 - 28 Nov 2017 15:50:57 GMT - Search in distribution**VOMS::Lite::RSAKey - Perl extension for RSA Key Generation**

VOMS::Lite::RSAKey::Create Generates an RSA key using the MillerRabin Prime search for probable primes. %inputref may have the following set Bits => bits e.g. 512 RandomFile /path/to/random e.g. /dev/random or /dev/urandom, or a reference to a functi...

MIKEJ/VOMS-Lite-0.20 - 02 Jul 2012 20:22:01 GMT - Search in distribution**Task::PerlFormance - Max dependencies for Benchmark::Perl::Formance**

SCHWIGON/Task-PerlFormance-0.007 - 06 May 2016 13:46:08 GMT - Search in distribution

**Bencher::Scenario::MathPrimeModules - Benchmark modules that find prime numbers**

Packaging a benchmark script as a Bencher scenario makes it convenient to include/exclude/add participants/datasets (either via CLI or Perl code), send the result to a central repository, among others . See Bencher and bencher (CLI) for more details....

PERLANCAR/Bencher-Scenario-MathPrimeModules-0.004 - 25 Jan 2017 06:28:36 GMT - Search in distribution