diff options
| author | Martin Wilke <miwi@FreeBSD.org> | 2008-03-30 00:09:07 +0000 |
|---|---|---|
| committer | Martin Wilke <miwi@FreeBSD.org> | 2008-03-30 00:09:07 +0000 |
| commit | a5148894fa248c86bac8b4e6eb9dbde1ca4e57ec (patch) | |
| tree | e391d12564aec7aa77030e085cb05d36927c6fac /math/msieve/pkg-descr | |
| parent | 6dc43b39787fcbde1d6094229de9822b6bffd2f8 (diff) | |
| download | ports-a5148894fa248c86bac8b4e6eb9dbde1ca4e57ec.tar.gz ports-a5148894fa248c86bac8b4e6eb9dbde1ca4e57ec.zip | |
Notes
Diffstat (limited to 'math/msieve/pkg-descr')
| -rw-r--r-- | math/msieve/pkg-descr | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/math/msieve/pkg-descr b/math/msieve/pkg-descr index c4db09b53695..0bca3d19f9d8 100644 --- a/math/msieve/pkg-descr +++ b/math/msieve/pkg-descr @@ -1,11 +1,11 @@ Msieve is a library and utility for factoring large integers using the most powerful modern algorithms. It features a stable and very fast implementation -of a self-initializing multiple polynomial quadratic sieve (MPQS), plus highly -experimental and unfinished general number field sieve (GNFS) code. +of a self-initializing multiple polynomial quadratic sieve (MPQS), plus a +somewhat experimental general number field sieve (GNFS) code. Primary design goals are speed, portability and ease of use. Msieve claims to be the fastest implementation for factoring general inputs between 40 and 100 -decimal digits. +decimal digits, but can handle larger input as well. Author: Jason Papadopoulos <jasonp@boo.net> WWW: http://www.boo.net/~jasonp/qs.html |