• Home
  • History
  • Annotate
Name Date Size #Lines LOC

..03-May-2022-

lib/Bytes/Random/Secure/H13-Jul-2015-730556

t/H13-Jul-2015-1,030777

ChangesH A D13-Jul-20151.1 KiB3929

LICENSEH A D06-Jun-20158.7 KiB203151

MANIFESTH A D07-Jul-2015637 3736

MANIFEST.SKIPH A D22-Jun-2015383 3127

META.jsonH A D13-Jul-20151.1 KiB4948

META.ymlH A D13-Jul-2015633 2524

Makefile.PLH A D07-Jul-20151.3 KiB3733

README.podH A D24-Jun-20151.6 KiB3526

README.pod

1=pod
2
3=head1 Bytes-Random-Secure-Tiny
4
5The minimal stuff needed from Bytes::Random::Secure, with no dependencies.
6
7=head1 Description
8
9This module provides a simple to use Cryptographically Secure Pseudo-Random
10Number Generator (CSPRNG) built around the ISAAC algorithm. Its methods
11include C<irand> for unsigned 32-bit integers, C<bytes> for simple random
12bytes, and C<string_from> for characters chosen at random from a bag of
13candidates. It also reliably seeds the CSPRNG from a secure source on a wide
14variety of platforms.
15
16The CPAN Module L<Bytes::Random::Secure> also produces high quality
17pseudo-randomness using the ISAAC cryptographically secure pseudo-random number
18generation algorithm, seeded using cryptographically secure entropy sources on
19a wide variety of operating systems. It has many configuration options. And
20provides both a functions and an object interface. But it has several
21dependencies, and its configurability and its user-interface, while flexible
22and useful, may expose more complexity than most use-cases require.
23
24Bytes::Random::Secure::Tiny's goal is to have no dependencies outside of the
25Perl core, and a simple interface that presents a minimal amount of
26configuration.  We asked ourselves, what are the essentials, and how can we
27achieve them in the most light-weight way?  This module is the answer we came
28up with.  We believe that this module will satisfy 90% of those users who were
29using Bytes::Random::Secure, but will do so with reduced complexity, a smaller
30user interface, and none of the frustration that dependencies can bring.
31
32See the documentation for L<Bytes::Random::Secure::Tiny> for more information.
33
34=cut
35