| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "ECPP-DJ"
(restored) |
m |
||
| Line 1: | Line 1: | ||
{{InfoboxProgram | {{InfoboxProgram | ||
|title=ECPP-DJ | |title=ECPP-DJ | ||
| − | |workload=ECPP, BLS75,<br>BPSW, AKS | + | |workload=ECPP, [[BLS75]],<br>BPSW, AKS |
|release=2013 | |release=2013 | ||
|latest=1.04<br><small>2014-08-16</small> | |latest=1.04<br><small>2014-08-16</small> | ||
| Line 17: | Line 17: | ||
Most of the utility functions closely follow the algorithms presented in Henri Cohen's book [http://plouffe.fr/simon/math/A%20course%20in%20computational%20algebraic%20number%20theory%20-%20Cohen.pdf "A Course in Computational Algebraic Number Theory"] (1993). The ECM factoring and manipulation was heavily inspired by GMP-ECM by Paul Zimmermann and many others. | Most of the utility functions closely follow the algorithms presented in Henri Cohen's book [http://plouffe.fr/simon/math/A%20course%20in%20computational%20algebraic%20number%20theory%20-%20Cohen.pdf "A Course in Computational Algebraic Number Theory"] (1993). The ECM factoring and manipulation was heavily inspired by GMP-ECM by Paul Zimmermann and many others. | ||
| − | It can verify ECPP certificates, which were generated by this program (or MPU) as well as [[Primo]]. It can be linked with [[MPZ APR-CL]] code to enable the [[APR-CL]] test. | + | It can verify ECPP certificates, which were generated by this program (or MPU) as well as [[Primo]]. It can be linked with [[MPZ APR-CL]] code to enable the [[Adleman–Pomerance–Rumely primality test|APR-CL]] test. |
Unlike Primo, this is an open-source implementation of ECPP test. However, Primo runs much faster for 1000+ digit numbers, especially on multi-core machines (ECPP-DJ is single threaded). | Unlike Primo, this is an open-source implementation of ECPP test. However, Primo runs much faster for 1000+ digit numbers, especially on multi-core machines (ECPP-DJ is single threaded). | ||
Revision as of 19:47, 14 February 2019
| Workload type | ECPP, BLS75, BPSW, AKS |
| First release | 2013 |
| Latest version | 1.04 2014-08-16 |
ECPP-DJ is a primality testing program created by Dana Jacobsen.
It is written in C using the GMP library. It is a standalone version of the ECPP implementation written for the Perlmodule Math::Prime::Util::GMP (MPU) in 2013.
It implements the following algorithms:
- ECPP test
- BPSW test (strong PRP-2 test followed by extra strong Lucas-Selfridge test)
- AKS test
- BLS75 (particularly, theorems 5/7 and 19)
Most of the utility functions closely follow the algorithms presented in Henri Cohen's book "A Course in Computational Algebraic Number Theory" (1993). The ECM factoring and manipulation was heavily inspired by GMP-ECM by Paul Zimmermann and many others.
It can verify ECPP certificates, which were generated by this program (or MPU) as well as Primo. It can be linked with MPZ APR-CL code to enable the APR-CL test.
Unlike Primo, this is an open-source implementation of ECPP test. However, Primo runs much faster for 1000+ digit numbers, especially on multi-core machines (ECPP-DJ is single threaded).
Example usage
To verify M12 using BLS75:
- $./ecpp-dj -V -bls 170141183460469231731687303715884105727
- N: 170141183460469231731687303715884105727
- BLS75 proof using N-1
- PRIME
External links
- Math::Prime::Util::GMP at GitHub
- ECPP-DJ thread at MersenneForum
