diff options
author | sno <sno> | 2013-07-03 14:33:32 +0000 |
---|---|---|
committer | sno <sno> | 2013-07-03 14:33:32 +0000 |
commit | 69b18e1309ab3662c98742321b9ac38d264c4f94 (patch) | |
tree | e2ec726ddd31fd9a9e130e64f31f2ab3060f492e /math | |
parent | 79b4579f4551ee4eae4056fb1079b3f91f8fd17b (diff) | |
download | pkgsrc-69b18e1309ab3662c98742321b9ac38d264c4f94.tar.gz |
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.
Diffstat (limited to 'math')
-rw-r--r-- | math/p5-Math-Random-ISAAC/DESCR | 15 | ||||
-rw-r--r-- | math/p5-Math-Random-ISAAC/Makefile | 22 | ||||
-rw-r--r-- | math/p5-Math-Random-ISAAC/distinfo | 5 |
3 files changed, 42 insertions, 0 deletions
diff --git a/math/p5-Math-Random-ISAAC/DESCR b/math/p5-Math-Random-ISAAC/DESCR new file mode 100644 index 00000000000..e02f61e8dff --- /dev/null +++ b/math/p5-Math-Random-ISAAC/DESCR @@ -0,0 +1,15 @@ +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. diff --git a/math/p5-Math-Random-ISAAC/Makefile b/math/p5-Math-Random-ISAAC/Makefile new file mode 100644 index 00000000000..f399515ea37 --- /dev/null +++ b/math/p5-Math-Random-ISAAC/Makefile @@ -0,0 +1,22 @@ +# $NetBSD: Makefile,v 1.1 2013/07/03 14:33:32 sno Exp $ +# + +DISTNAME= Math-Random-ISAAC-1.004 +PKGNAME= p5-${DISTNAME} +CATEGORIES= math perl5 security +MASTER_SITES= ${MASTER_SITE_PERL_CPAN:=Math/} + +MAINTAINER= pkgsrc-users@NetBSD.org +HOMEPAGE= http://search.cpan.org/dist/Math-Random-ISAAC/ +COMMENT= Perl interface to the ISAAC PRNG algorithm +LICENSE= cc0-1.0-universal + +DEPENDS+= p5-Math-Random-ISAAC-XS-[0-9]*:../../math/p5-Math-Random-ISAAC-XS + +BUILD_DEPENDS+= p5-Test-NoWarnings>=0.084:../../devel/p5-Test-NoWarnings + +USE_LANGUAGES= c +PERL5_PACKLIST= auto/Math/Random/ISAAC/.packlist + +.include "../../lang/perl5/module.mk" +.include "../../mk/bsd.pkg.mk" diff --git a/math/p5-Math-Random-ISAAC/distinfo b/math/p5-Math-Random-ISAAC/distinfo new file mode 100644 index 00000000000..1f69aac7242 --- /dev/null +++ b/math/p5-Math-Random-ISAAC/distinfo @@ -0,0 +1,5 @@ +$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 |