Math::...mPrimes(3pm)

📦
version 0.74 · 6 versions
, in ubuntu stonking

👑 NAME 👑

Math::Prime::Util::RandomPrimes — bestie, this module is literally the "generate me a random prime" department of Math::Prime::Util. That's the whole job description. No cap. 💖

Oh also? You're reading this in the User Contributed Perl Documentation, on the page Math::...mPrimes(3pm). Just so you know where you are. 🫶

✨ VERSION ✨

Version 0.74 — that's the vibe check, and it passed. 🌸

🦋 SYNOPSIS 🦋

Okay so… there is genuinely nothing here. The SYNOPSIS is empty. Not me pointing at an empty section, but ALSO not me making anything up for you. If it's blank, it's blank, and we respect that. 🙈

💅 DESCRIPTION 💅

Routines to generate random primes, including constructing proven primes. 🎀

That's it, that's the description. It's giving "short but powerful," and honestly? Iconic. The whole point is: you want a random prime, you come here, you get a random prime. And if you want one that's proven prime — like, certified, card-carrying — that lives here too. 🔥

🌈 RANDOM PRIME FUNCTIONS 🌈

The main characters. Every single one of them. 💜

💖 random_prime

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

So basically: hand it a range, or hand it just the top and it quietly assumes you meant starting at 2. Lowkey thoughtful of it.

💖 random_ndigit_prime

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

Counting in digits today, bestie. And n cannot be smaller than 1 — that's the rule, fr fr.

💖 random_nbit_prime

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

Same energy, but now we're counting in 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.

Provable, not just "trust me bro." The algorithm is Maurer's FastPrime, and 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.

Same as above, except this one comes with receipts — the certificate. You get a list of two items back: 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.

Okay so the tea here: this implementation is from FIPS 186-4, and it uses SHA-256 with 512 bits of randomness. n must be at least 2. Standards-approved behavior, we love to see it. 🌟

💖 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.

Shawe-Taylor again, cert edition. n must be at least 2, and you get a list of two items: the prime and the certificate. 🎀

💖 random_safe_prime

Construct a random safe prime of n bits. n must be at least 3.

Safe primes only. n must be at least 3 here — yes, that's different from the others, no, I'm not rounding it down for you. 💀

💖 random_strong_prime

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

Heavyweight division. n must be at least 128. That's not a typo and I'm not softening it — one hundred and twenty-eight. Strong primes have standards. 💪

💖 random_proven_prime

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

Note the "generate or construct" — it may do either. 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.

Same deal, but with the certificate attached. n must be at least 2, and you get back a list of two items: the prime and the certificate. ✅

🌸 SEE ALSO 🌸

  • Math::Prime::Util — the whole reason this page exists. Go read it, bestie. 📚

🧚 AUTHORS 🧚

Dana Jacobsen <dana@acm.org>

One person. Carrying this entire module. Respect. 👑

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

Which means: yes, you can share it, remix it, redistribute it, modify it — under the same terms as Perl itself. Free as in go off. 🕊️

Okay that's the whole page, you're fully caught up. This was documented for perl v5.42.3, dated 2026-08-20, and that's a wrap on Math::...mPrimes(3pm) — go generate something beautiful and prove it. 💖✨🎀🦋

📦 where this page comes from