The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.
 / 
Math-Prime-Util-0.73
River stage two • 12 direct dependents • 19 total dependents
22 ++
/ Math::Prime::Util::RandomPrimes

NAME

Math::Prime::Util::RandomPrimes - Generate random primes

VERSION

Version 0.73

SYNOPSIS

DESCRIPTION

Routines to generate random primes, including constructing proven primes.

RANDOM PRIME FUNCTIONS

random_prime

Generate a random prime between low and high. If given one argument, low will be 2.

random_ndigit_prime

Generate a random prime with n digits. n must be at least 1.

random_nbit_prime

Generate a random prime with n bits. n must be at least 2.

random_maurer_prime

Construct a random provable prime of n bits using Maurer's FastPrime algorithm. n must be at least 2.

random_maurer_prime_with_cert

Construct a random provable prime of n bits using Maurer's FastPrime algorithm. n must be at least 2. Returns a list of two items: the prime and the certificate.

random_shawe_taylor_prime

Construct a random provable prime of n bits using Shawe-Taylor's algorithm. n must be at least 2. The implementation is from FIPS 186-4 and uses SHA-256 with 512 bits of randomness.

random_shawe_taylor_prime_with_cert

Construct a random provable prime of n bits using Shawe-Taylor's algorithm. n must be at least 2. Returns a list of two items: the prime and the certificate.

random_strong_prime

Construct a random strong prime of n bits. n must be at least 128.

random_proven_prime

Generate or construct a random provable prime of n bits. n must be at least 2.

random_proven_prime_with_cert

Generate or construct a random provable prime of n bits. n must be at least 2. Returns a list of two items: the prime and the certificate.

SEE ALSO

Math::Prime::Util

AUTHORS

Dana Jacobsen <dana@acm.org>

COPYRIGHT

Copyright 2012-2013 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.