| Name : msieve
| |
| Version : 1.49
| Vendor : obs://build_opensuse_org/home:vodoo
|
| Release : 12.44
| Date : 2015-03-01 02:58:30
|
| Group : Productivity/Scientific/Math
| Source RPM : msieve-1.49-12.44.src.rpm
|
| Size : 0.56 MB
| |
| Packager : (none)
| |
| Summary : Program and library for factoring large integers
|
Description :
There are plenty of algorithms for performing integer factorization.
The Msieve library implements most of them from scratch, and relies on
optional external libraries for the rest of them. Trial division and
Pollard Rho is used on all inputs; if the result is less than 25 digits
in size, tiny custom routines do the factoring. For larger numbers, the code
switches to the GMP-ECM library and runs the P-1, P+1 and ECM algorithms,
expending a user-configurable amount of effort to do so. If these do not
completely factor the input number, the library switches to the heavy
artillery. Unless told otherwise, Msieve runs the self-initializing quadratic
sieve algorithm, and if this doesn\'t factor the input number then you\'ve
found a library problem. If you know what you\'re doing, Msieve also contains
a complete implementation of the number field sieve, that has helped complete
some of the largest public factorization efforts known.
The maximum size of numbers that can be given to the library is hardwired
at compile time. Currently the code can handle numbers up to 275 digits.
Author: Jason Papadopoulos
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/home:/vodoo/openSUSE_Factory/i586 |
Hmm ... It's impossible ;-) This RPM doesn't exist on any FTP server
Provides :
msieve
msieve(x86-32)
Requires :
