mersenneforum.org How To Calculate SNFS Poly?
 Register FAQ Search Today's Posts Mark Forums Read

 2015-05-27, 20:14 #1 Stargate38     "Daniel Jackson" May 2011 14285714285714285714 76910 Posts How To Calculate SNFS Poly? How do I calculate a SNFS poly? Is there an easy formula based on N? Last fiddled with by Stargate38 on 2015-05-27 at 20:17
 2015-05-27, 20:21 #2 VBCurtis     "Curtis" Feb 2005 Riverside, CA 7×829 Posts Give an example of the form of the number you wish to factor. There are many cases.
 2015-05-27, 20:35 #3 Stargate38     "Daniel Jackson" May 2011 14285714285714285714 76910 Posts (n2p+1)/(n2+1) with prime p n2[SUP]x[/SUP]+1 an±bn (take out algebraic factors first) i.e. 46074500107087988+1 (known factor before I factored it: 449). I wasted 2-3 CPU-days doing GNFS on it, before I realized that I could have done it in a matter of hours with SNFS. Last fiddled with by Stargate38 on 2015-05-27 at 20:42
 2015-05-27, 21:30 #4 wblipp     "William" May 2003 Near Grandkid 94716 Posts Have you read the Mersenne Wiki article on polynomial selection?
2015-05-27, 21:47   #5
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

22×1,889 Posts

Quote:
 Originally Posted by Stargate38 How do I calculate a SNFS poly? Is there an easy formula based on N?
Optimal Parameterization of SNFS. J. Math. Cryptology

2015-05-27, 21:52   #6
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

22×1,889 Posts

Quote:
 Originally Posted by Stargate38 (n2p+1)/(n2+1) with prime p n2[SUP]x[/SUP]+1 an±bn (take out algebraic factors first) i.e. 46074500107087988+1 (known factor before I factored it: 449). I wasted 2-3 CPU-days doing GNFS on it, before I realized that I could have done it in a matter of hours with SNFS.
May I suggest that it would be helpful if you would learn how to perform polynomial algebra??

For your first question (n^2p + 1)/(n^2+1) may I suggest performing the division and looking at the
result? One gets a dense polynomial of degree 2p-2........

n^(2^x) + 1 is algebraically prime.

for a^n +/- b^n, start by factoring it, completely. Or are you asking about the primitive cofactor?

Last fiddled with by R.D. Silverman on 2015-05-27 at 21:54

 2015-05-27, 22:12 #7 Dubslow Basketry That Evening!     "Bunslow the Bold" Jun 2011 40
2015-05-27, 23:09   #8
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

22·1,889 Posts

Quote:
 Originally Posted by Dubslow Yafu can do automatic snfs poly selection for the example as well as the second two forms (though I don't know if it can take advantage of the power of 2 exponent, or if that's even possible).
Another example of: "don't think, just throw a computer at it".

The OP asked HOW. Suggesting to use a black box does not answer that question.

Indeed. Your statement "I don't know........possible." suggests that you should not
have even tried to answer this question.

(Hint: Once you have decided the degree for the SNFS algebraic polynomial for 2^2^n+1,
it is trivial first year algebra to find the representation).

 Similar Threads Thread Thread Starter Forum Replies Last Post ryanp Factoring 6 2013-07-19 17:23 schickel FactorDB 0 2011-12-16 18:07 JoeCrump Factoring 3 2009-10-29 21:00 nuggetprime Factoring 22 2008-08-15 10:01 fropones Lone Mersenne Hunters 1 2003-05-27 23:01

All times are UTC. The time now is 00:28.

Sun Jun 4 00:28:32 UTC 2023 up 289 days, 21:57, 0 users, load averages: 1.10, 1.02, 0.94