|
2003-08-07, 20:49
|
#12 | |
"Sander"
Oct 2002
52.345322,5.52471
29×41 Posts |
Quote:
Pollard Rho quidric sieve (mpqs, siqs) |
|
|
|
|
2003-08-08, 11:35
|
#13 | ||
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2·5,393 Posts |
Quote:
There are dozens, if not hundreds. Browsing through some of the standard texts such as Riesel, Crandall&Pomerance, Knuth, Cohen will turn up many more. SQUFOF, for instance is widely used to factoring double-length integers. Dixon's algorithm is provably sub-exponential (unlike NFS and QS which are only heuristically so), very easy to program, and completely impractical in real life. CFRAC to the quadratic sieve. Zhang's Special QS is a neat way of making the QS run faster for numbers of a special form. Of historical interest are Legendre's and Gauss' algorithms. An algorithm for finding small factors of a large number of integers is first to form the product of small primes and take GCDs. Yes, this one is used in real life. Paul |
||
|
|
|
 |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| SQUFOF implementation | alpertron | Factoring | 15 | 2010-04-12 19:16 |
| ECM/FPGA Implementation | rdotson | Hardware | 12 | 2006-03-26 22:58 |
| need C implementation of divb(r,k) | Leith | Miscellaneous Math | 4 | 2005-01-18 23:14 |
| RSA implementation | flava | Programming | 12 | 2004-10-26 03:51 |
| Types of work to request from server : Add P-1 Factoring | MoZ | Software | 2 | 2004-02-06 20:24 |
