./math/p5-Math-Random-ISAAC, Perl interface to the ISAAC PRNG algorithm

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2013Q3, Version: 1.004, Package name: p5-Math-Random-ISAAC-1.004, Maintainer: pkgsrc-users

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, Shift, Accumulate, Add, and Count) has
different goals than these commonly used algorithms. In particular, it's
really fast - on average, it requires only 18.75 machine cycles to generate
a 32-bit value. This makes it suitable for applications where a significant
amount of random data needs to be produced quickly, such solving using the
Monte Carlo method or for games.

The results are uniformly distributed, unbiased, and unpredictable unless
you know the seed. The algorithm was published by Bob Jenkins in the late
90s and despite the best efforts of many security researchers, no feasible
attacks have been found to date.


Required to run:
[math/p5-Math-Random-ISAAC-XS]

Master sites: (Expand)

SHA1: 0d2e423559ed28d842e6907e3944d6c5b6f2705f
RMD160: 6a77fc0f57b92e9331c233a0f59d77acae7d8fe0
Filesize: 33.638 KB

Version history: (Expand)