| Math::Prime::Util::RandomPrimes(3pm) | User Contributed Perl Documentation | Math::Prime::Util::RandomPrimes(3pm) |
Math::Prime::Util::RandomPrimes - Generate random primes
Version 0.73
Routines to generate random primes, including constructing proven primes.
Generate a random prime between "low" and "high". If given one argument, "low" will be 2.
Generate a random prime with "n" digits. "n" must be at least 1.
Generate a random prime with "n" bits. "n" must be at least 2.
Construct a random provable prime of "n" bits using Maurer's FastPrime algorithm. "n" must be at least 2.
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.
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.
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.
Construct a random strong prime of "n" bits. "n" must be at least 128.
Generate or construct a random provable prime of "n" bits. "n" must be at least 2.
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.
Math::Prime::Util
Dana Jacobsen <dana@acm.org>
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.
| 2022-10-20 | perl v5.36.0 |