20180929, 17:23  #1 
Mar 2014
South Korea
2^{4} Posts 
On the efficiency of SNFS for "dirty" numbers
Hi,
This time I want to factor (2^3001)*10^91+2^2991 and similar numbers. The number is very close to 2^300*10^91 and a reasonable SNFS polynomial will be something like 10*x^5+2^29910^911, where x=2^60*10^18. Now my concern is that c0=2^29910^911 looks very big. The question is: Is there significant performance drop if SNFS polynomial is "dirty" like this case? If so, how the people who SNFSed 150^149+149^150 or other numbers solved this issue? 
20180929, 17:48  #2 
Mar 2014
South Korea
2^{4} Posts 
So the SNFS polynomials of XYYXF numbers are of the these form.
How can I create a .poly file of these form? Is there any online guide? 
20180929, 18:22  #3  
"Robert Gerbicz"
Oct 2005
Hungary
2625_{8} Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
What should the "q" value increase to for GNFS/SNFS computations?  2147483647  Factoring  2  20161210 08:42 
NFS@Home "Status of numbers" page to update  pinhodecarlos  NFS@Home  2  20150704 11:18 
Looking for PrimeKit from "Prime Numbers A Computational Perspective"  gszpetkowski  Factoring  13  20140805 11:57 
Would Minimizing "iterations between results file" may reveal "is not prime" earlier?  nitai1999  Software  7  20040826 18:12 
trial factoring of "small" mersenne numbers  antiroach  Lone Mersenne Hunters  6  20030716 23:35 