{"id":15514831,"url":"https://github.com/fgasper/p5-math-provableprime","last_synced_at":"2025-07-11T19:35:15.507Z","repository":{"id":56834187,"uuid":"76127161","full_name":"FGasper/p5-Math-ProvablePrime","owner":"FGasper","description":"CPAN’s Math::ProvablePrime","archived":false,"fork":false,"pushed_at":"2021-09-10T11:53:54.000Z","size":79,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-03-28T19:21:39.168Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Perl","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/FGasper.png","metadata":{"files":{"readme":"README.md","changelog":"Changes","contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2016-12-10T17:27:10.000Z","updated_at":"2021-09-10T11:53:46.000Z","dependencies_parsed_at":"2022-09-10T05:22:06.329Z","dependency_job_id":null,"html_url":"https://github.com/FGasper/p5-Math-ProvablePrime","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"purl":"pkg:github/FGasper/p5-Math-ProvablePrime","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FGasper%2Fp5-Math-ProvablePrime","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FGasper%2Fp5-Math-ProvablePrime/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FGasper%2Fp5-Math-ProvablePrime/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FGasper%2Fp5-Math-ProvablePrime/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/FGasper","download_url":"https://codeload.github.com/FGasper/p5-Math-ProvablePrime/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FGasper%2Fp5-Math-ProvablePrime/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":264887355,"owners_count":23678668,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-02T10:00:42.608Z","updated_at":"2025-07-11T19:35:15.489Z","avatar_url":"https://github.com/FGasper.png","language":"Perl","funding_links":[],"categories":[],"sub_categories":[],"readme":"# NAME\n\nMath::ProvablePrime - Generate a provable prime number, in pure Perl\n\n# SYNOPSIS\n\n    #The returned prime will be 512 bits long\n    #(i.e., the first and last bits will be 1)\n    #and will be an instance of Math::BigInt.\n    #\n    my $prime = Math::ProvablePrime::find(512);\n\n# DISCUSSION\n\nThere’s not much more to say: this module returns a prime number of a\nspecified bit length.\n\nThe specific algorithm is Maurer’s algorithm. The logic in this module\nis ported from a Python implementation first posted at\n[http://s13.zetaboards.com/Crypto/topic/7234475/1/](http://s13.zetaboards.com/Crypto/topic/7234475/1/).\n\n# PLANNED DEPRECATION\n\nThis module will be deprecated once [Math::Prime::Util](https://metacpan.org/pod/Math::Prime::Util) is installable without\na compiler. (There is pure-Perl logic in that distribution; the install\nlogic just needs to be tweaked.) [Math::Prime::Util](https://metacpan.org/pod/Math::Prime::Util) is faster and has a\nmaintainer who understands the mathematics behind all of this much better\nthan I do.\n\n[Math::ProvablePrime](https://metacpan.org/pod/Math::ProvablePrime) is too slow for its\nintended purpose (i.e., to provide pure-Perl primes), and really, I don’t have\nthe mathematical background that would justify its continued maintenance.\n\nIf you have any objection, please let me know.\n\n# SPEED\n\nThis module is too slow for practical use in pure Perl. If a recognized\nalternate backend for [Math::BigInt](https://metacpan.org/pod/Math::BigInt) is available, though, then this module\nwill use that to achieve reasonable (though still unimpressive) speed.\n\nRecognized alternate backends are (in order of preference):\n\n- [Math::BigInt::GMPz](https://metacpan.org/pod/Math::BigInt::GMPz)\n- [Math::BigInt::GMP](https://metacpan.org/pod/Math::BigInt::GMP)\n- [Math::BigInt::LTM](https://metacpan.org/pod/Math::BigInt::LTM)\n- [Math::BigInt::Pari](https://metacpan.org/pod/Math::BigInt::Pari)\n\n[Math::BigInt::BitVect](https://metacpan.org/pod/Math::BigInt::BitVect) and [Math::BigInt::FastCalc](https://metacpan.org/pod/Math::BigInt::FastCalc) are also\nrecognized, but these don’t seem to achieve speed that’s practical\nfor use in, e.g., creation of RSA keys.\n\n# LICENSE\n\nThis module is released under the same license as Perl.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffgasper%2Fp5-math-provableprime","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffgasper%2Fp5-math-provableprime","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffgasper%2Fp5-math-provableprime/lists"}