--- - branch: MAIN date: Sun Sep 17 20:11:00 UTC 2017 files: - new: '1.17' old: '1.16' path: pkgsrc/math/p5-Math-Prime-Util/Makefile pathrev: pkgsrc/math/p5-Math-Prime-Util/Makefile@1.17 type: modified - new: '1.13' old: '1.12' path: pkgsrc/math/p5-Math-Prime-Util/distinfo pathrev: pkgsrc/math/p5-Math-Prime-Util/distinfo@1.13 type: modified id: 20170917T201100Z.c945187435c25e2bd141bad398cd6a560faca47d log: | p5-Math-Prime-Util: update to 0.66. 0.66 2017-09-12 [ADDED] - random_semiprime random n-bit semiprime (even split) - random_unrestricted_semiprime random n-bit semiprime - forderange { ... } n derangements iterator - numtoperm(n,k) returns kth permutation of n elems - permtonum([...]) returns rank of permutation array ref - randperm(n[,k]) random permutation of n elements - shuffle(...) random permutation of an array [FUNCTIONALITY AND PERFORMANCE] - Rewrite sieve marking based on Kim Walisch's new simple mod-30 sieve. Similar in many ways to my old code, but this is simpler and faster. - is_pseudoprime, is_euler_pseudoprime, is_strong_pseudoprime changed to better handle the unusual case of base >= n. - Speedup for is_carmichael. - is_frobenius_underwood_pseudoprime checks for jacobi == 0. Faster. - Updated Montgomery inverse from Robert Gerbicz. - Tighter nth prime bounds for large inputs from Axler 2017-06. Redo Ramanujan bounds since they're based on nth prime bounds. - chinese objectifies result (i.e. big results are bigints). - Internal support for Baillie-Wagstaff (pg 1402) extra Lucas tests. - More standardized Lucas parameter selection. Like other tests and the 1980 paper, checks jacobi(D) in the loop, not gcd(D). - entropy_bytes, srand, and csrand moved to XS. - Add -secure import to disallow all manual seeding. module: pkgsrc subject: 'CVS commit: pkgsrc/math/p5-Math-Prime-Util' unixtime: '1505679060' user: wiz