### Search results for "module:Math::Random::ISAAC"

###
Math::Random::ISAAC - Perl interface to the ISAAC PRNG algorithm

As with other Pseudo-Random Number Generator (PRNG) algorithms like the Mersenne Twister (see Math::Random::MT), this algorithm is designed to take some seed information and produce seemingly random results as output. However, ISAAC (Indirection, Shi...

JAWNSY/Math-Random-ISAAC-1.004 - 18 Feb 2011 02:34:58 UTC###
Math::Random::ISAAC::PP - Pure Perl port of the ISAAC PRNG algorithm

See Math::Random::ISAAC for the full description....

JAWNSY/Math-Random-ISAAC-1.004 - 18 Feb 2011 02:34:58 UTC###
Math::Random::ISAAC::XS - C implementation of the ISAAC PRNG algorithm

See Math::Random::ISAAC for the full description....

JAWNSY/Math-Random-ISAAC-XS-1.004 - 18 Feb 2011 02:46:48 UTC###
Math::Int64 - Manipulate 64 bits integers in Perl

This module adds support for 64 bit integers, signed and unsigned, to Perl. Exportable functions int64() int64($value) Creates a new int64 value and initializes it to $value, where $value can be a Perl number or a string containing a number. For inst...

SALVA/Math-Int64-0.54 - 04 Jan 2016 09:08:26 UTC###
Math::Random::PCG32 - minimal PCG random number generator

This module includes a minimal PCG (Permuted Congruential Generator) for random numbers <http://www.pcg-random.org/> and some utility routines for PCG (Procedural Content Generation). A RANDOM BENCHMARK This pits the (very bad) core "rand" function a...

JMATES/Math-Random-PCG32-0.23 - 24 Jul 2022 02:51:03 UTC###
Math::Prime::Util - Utilities related to prime numbers, including fast sieves and factoring

A module for number theory in Perl. This includes prime sieving, primality tests, primality proofs, integer factoring, counts / bounds / approximations for primes, nth primes, and twin primes, random prime generation, and much more. This module is th...

DANAJ/Math-Prime-Util-0.73 - 15 Nov 2018 18:56:14 UTC###
Math::Random::Secure - Cryptographically-secure, cross-platform replacement for rand()

This module is intended to provide a cryptographically-secure replacement for Perl's built-in "rand" function. "Crytographically secure", in this case, means: * No matter how many numbers you see generated by the random number generator, you cannot g...

FREW/Math-Random-Secure-0.080001 - 12 Mar 2017 22:46:35 UTC###
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.52 - 22 Jun 2020 09:19:08 UTC###
Math::Random::Xorshift - a fast PRNG

This module is a straight forward implementation of Xorshift PRNG proposed by G. Marsaglia in 2003. Note that the algorithm is extremely fast and passes the Diehard test <http://www.stat.fsu.edu/pub/diehard/> though, is not reliable enough statistica...

SEKIA/Math-Random-Xorshift-0.05 - 22 Dec 2010 06:44:26 UTC###
Math::Random::Secure::RNG - The underlying PRNG, as an object.

This represents a random number generator, as an object. Generally, you shouldn't have to worry about this, and you should just use Math::Random::Secure. But if for some reason you want to modify how the random number generator works or you want an o...

FREW/Math-Random-Secure-0.080001 - 12 Mar 2017 22:46:35 UTC