18c29c6a72
powerful modern algorithms. It features a stable and very fast implementation of a self-initializing multiple polynomial quadratic sieve (MPQS), plus a highly experimental and unfinished number field sieve (NFS) implementation. 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. Author: Jason Papadopoulos <jasonp@boo.net> WWW: http://www.boo.net/~jasonp/qs.html PR: ports/107477 Submitted by: Daniel Roethlisberger <daniel at roe.ch>
11 lines
563 B
Plaintext
11 lines
563 B
Plaintext
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 a
|
|
highly experimental and unfinished number field sieve (NFS) implementation.
|
|
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.
|
|
|
|
Author: Jason Papadopoulos <jasonp@boo.net>
|
|
WWW: http://www.boo.net/~jasonp/qs.html
|