![]() |
|
|
#12 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
gcc version shouldn't be a problem.
To generate just a few relations you may use either msieve alone (first generate any polynomial in -np mode, then sieve by its own line sieve), or by ggnfs suite - it contains a frightening lattice siever by Kleinjung+Franke. Because you only need a few relations, you will easily get away by setting the FB and LP limits low. Once you will get relations, note that their factorizations are by convention not listing the factors under 1000 (iirc). But these are easily reconstructed for example in Pari/GP shell or a one-off c+GMPlib (or perl+Math::BigInt) program. (Or you can fiddle with the guts of either gnfs-lasieve4e.c or msieve relation.c, again iirc, in order to print out all factors.)
|
|
|
|
|
|
#13 |
|
Tribal Bullet
Oct 2004
354110 Posts |
Note that even a line sieve would have difficulty with 1024-bit GNFS; I tried with an older version of the current line sieve, and even with a factor base limit of 2^32 it only found three relations.
|
|
|
|
|
|
#14 |
|
May 2011
101112 Posts |
I see.. I managed to get the sieving of RSA-768 to work on another PC. Thanks a lot for the help! =)
|
|
|
|
|
|
#15 |
|
May 2011
23 Posts |
Sorry another question, is it possible to remove the 308 digit limit to conduct some tests? i tried to edit some parts of the code but i think i am missing something crucial.
|
|
|
|
|
|
#16 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36×13 Posts |
You need to increase the
#define MAX_MP_WORDS 32 in mp.h to something bigger. The other places you probably already found. |
|
|
|
|
|
#17 |
|
May 2011
23 Posts |
Hmm, i tried changing that to 34 or 40 but it still doesnt work. The error i got was:
warning: NFS input not found in factor base file Any idea why i got that? |
|
|
|
|
|
#18 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
224058 Posts |
include/common.h:#define LINE_BUF_SIZE 300
|
|
|
|
|
|
#19 |
|
May 2011
278 Posts |
Thanks a lot!! I can run it now!! So that was the problem.. =D
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Too few cycles error | cardmaker | Factoring | 4 | 2016-12-29 15:52 |
| "lanczos error: only trivial dependencies found" with massive oversieving | eigma | Msieve | 21 | 2015-05-28 03:27 |
| 3n + 1 cycles for n = 2^57,885,161-1 | Unregistered | Information & Answers | 7 | 2013-02-16 02:24 |
| Cheapest CPU cycles? | siegert81 | Hardware | 17 | 2010-12-27 18:00 |
| CPU cycles | Unregistered | Information & Answers | 0 | 2007-07-19 12:24 |