[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]

**To**:**pkgsrc-changes%NetBSD.org@localhost****Subject**:**CVS commit: pkgsrc/math/p5-Math-Random-ISAAC****From**:**"Jens Rehsack" <sno%netbsd.org@localhost>**- Date: Wed, 3 Jul 2013 14:33:32 +0000

Module Name: pkgsrc Committed By: sno Date: Wed Jul 3 14:33:32 UTC 2013 Added Files: pkgsrc/math/p5-Math-Random-ISAAC: DESCR Makefile distinfo Log Message: Adding package for CPAN distribution Math-Random-ISAAC version 1.004 into math/p5-Math-Random-ISAAC. 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. To generate a diff of this commit: cvs rdiff -u -r0 -r1.1 pkgsrc/math/p5-Math-Random-ISAAC/DESCR \ pkgsrc/math/p5-Math-Random-ISAAC/Makefile \ pkgsrc/math/p5-Math-Random-ISAAC/distinfo Please note that diffs are not public domain; they are subject to the copyright notices on the relevant files.

- Prev by Date:
**CVS commit: pkgsrc/doc** - Next by Date:
**CVS commit: pkgsrc/doc** - Previous by Thread:
**CVS commit: pkgsrc/doc** - Next by Thread:
**CVS commit: pkgsrc/doc** - Indexes: