pkgsrc/math/p5-Math-Random-ISAAC/distinfo

$NetBSD: distinfo,v 1.1 2013/07/03 14:33:32 sno Exp $

SHA1 (Math-Random-ISAAC-1.004.tar.gz) = 0d2e423559ed28d842e6907e3944d6c5b6f2705f
RMD160 (Math-Random-ISAAC-1.004.tar.gz) = 6a77fc0f57b92e9331c233a0f59d77acae7d8fe0
Size (Math-Random-ISAAC-1.004.tar.gz) = 34445 bytes
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. 2013-07-03 16:33:32 +02:00			$NetBSD: distinfo,v 1.1 2013/07/03 14:33:32 sno Exp $

			`SHA1 (Math-Random-ISAAC-1.004.tar.gz) = 0d2e423559ed28d842e6907e3944d6c5b6f2705f`
			`RMD160 (Math-Random-ISAAC-1.004.tar.gz) = 6a77fc0f57b92e9331c233a0f59d77acae7d8fe0`
			`Size (Math-Random-ISAAC-1.004.tar.gz) = 34445 bytes`