/ 
Math-Prime-Util-0.65
River stage two • 13 direct dependents • 21 total dependents
/ Math::Prime::Util::ISAAC

NAME

Math::Prime::Util::ISAAC - Pure Perl ISAAC CSPRNG

VERSION

Version 0.65

SYNOPSIS

DESCRIPTION

A pure Perl implementation of ISAAC with a CSPRNG interface.

FUNCTIONS

csrand

Takes a binary string as input and seeds the internal CSPRNG.

srand

A method for sieving the CSPRNG with a small value. This will not be secure but can be useful for simulations and emulating the system srand.

With no argument, chooses a random number, seeds and returns the number. With a single integer argument, seeds and returns the number.

irand

Returns a random 32-bit integer.

irand64

Returns a random 64-bit integer.

random_bytes

Takes an unsigned number n as input and returns that many random bytes as a single binary string.

AUTHORS

Dana Jacobsen <dana@acm.org>

ACKNOWLEDGEMENTS

Bob Jenkins wrote ISAAC in 1996, which is a seriously fast CSPRNG.

John Allen did the port to Perl in 2000.

Jonathan Yu released Math::Random::ISAAC in 2009 and has maintained it since.

David Oswald trimmed the code substantially for Bytes::Random::Secure::Tiny. Our code is based on that code.

COPYRIGHT

Copyright 2017 by Dana Jacobsen <dana@acm.org>

This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.