|
|
 |
Published by Chris Nash
Click here for more information about this publisher...
|
|
|
Date Posted: |
May 10th, 2001
|
|
|
Last Updated: |
May 10th, 2001
|
|
|
License: |
GPL |
|
|
Downloads: |
270 total; 1 recently |
|
|
Page Views: |
5,667 total |
|
|
User Rating: |
awaiting 10 votes |
 |
|
Jump to the Downloads section |
|
|
|
About gmp-ecm:
A BeOS build of Paul Zimmerman's gmp-ecm, a free implementation of the Elliptic Curve Method (ECM) to factor integers, based on the GMP library. gmp-ecm may be used to participate in several integer factorization projects such as ECMNET, or to assist in primality proofs.
Lenstra's elliptic curve method allows factors of reasonable size to be found using a probabilistic algorithm. One run of the gmp-ecm program will test a given number against a given elliptic curve. With several runs of the program, factors of a particular size may be found with high probability.
The archive also includes shell scripts that apply the recommended command-line options for finding factors of a given size.
The BeOS build requires the GMP shared library, available from bebits at the link below.
|
|
|
 |
Latest Version |
 |
|
|
| |
|
|
Details about this version:
Includes significant optimizations over earlier versions of the program. The BeOS build is configured to enable output and display of very large source numbers.
|
| |
|
|
Intel Version - requires R5 (76 KB) |
270 downloads |
|
|
|
|
|
| |
  |
[rating: 10] |
|
|
primeform.net |
|
|
| Add Additional Location |
|
|
|
|
| Source Included |
|
 |
|
 |
|
Like this app? Have questions or comments?
Why not tell the author? Use the "e-mail publisher" link to get in touch with the publisher; they usually love getting feedback.
|
|
|
