mersenneforum.org Best case Fermat Factors
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2012-12-11, 06:15 #1 yourskadhir   Dec 2012 112 Posts Best case Fermat Factors The logic that it is hard to do Fermat factorization for odd composite which is a product of two large prime factors with big difference is wrong. Reason when those primes are best Fermat factors then Fermat factorization will be very easy. For more details please follow the link http://kadinumberprops.blogspot.in
 2012-12-11, 07:51 #2 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 3·132·19 Posts Then it would be no problem for you to factor Code: 4872694181406339617512781250710256288128420426749870494701352170485888238522036701839697408990043865362740060996930806408048841117542674271031589079075642908938171217283398153697602454775549091739003927335892645964656077739143953748851155087308230066486278985637829660170144978240247037951 ? ?
 2012-12-11, 09:45 #3 akruppa     "Nancy" Aug 2002 Alexandria 46438 Posts Straight to Misc. Math.
 2012-12-11, 10:06 #4 yourskadhir   Dec 2012 38 Posts Please understand i didn't mean it. Please understand i gave the fresh analysis of Fermat factorization and i coined the term Best Fermat factor. Please reply whether you understood the article thoroughly. I said Fermat factorization complexity is easy when the number's factors are Best Fermat factors or Nearer to Best Fermat factors.
2012-12-11, 18:39   #5
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts

Quote:
 Originally Posted by Batalov Then it would be no problem for you to factor Code: 4872694181406339617512781250710256288128420426749870494701352170485888238522036701839697408990043865362740060996930806408048841117542674271031589079075642908938171217283398153697602454775549091739003927335892645964656077739143953748851155087308230066486278985637829660170144978240247037951 ? ?
here's what I got from reading it:

N=a^2-b^2 ~ s^2
d=2n

so say y is the lower factor in a 2 best factor setup y+2n is the other to go along with it y*(y+2n) = y^2+2ny~s^2 this leads to s^2-y^2 ~ 2ny since both y^2 and 2ny have a common factor y, so do ~s^2 and y^2 namely y so in closing the lowest of the 2 has a multiple close to the sqrt of the N to be factored. of course how close depends on the amount of rounding I think.

edit: ~ is for approximately.

Last fiddled with by science_man_88 on 2012-12-11 at 18:39

 2012-12-12, 04:18 #6 LaurV Romulan Interpreter     "name field" Jun 2011 Thailand 22·11·223 Posts That is too heavy! Next number is a C170, whose two prime factors ratio is very close to "best fermat factor" ratio, the distance to such a split is lower than 1/10^40 (i.e. 0.000(about35zeroes)0001). There should be no problem to factor it, and if this is possible, it should be nice, because there is no other method (beside long taking gnfs) to factor it: both factors are P-1 and ECM "tough" - I did not make them so on pupose, they just come out like that from the first trial of nextprime(random(perfectsplit)), hehe. So, it should resist p-1 and ECM trials. You only have to try the other primes in the ~10^30 interval that remained. Code: 54553746256351348704340853049775196132111315873148539674440243786571807634659955885688337948063058916001903005889468533003195598599269527286081791979809069615167325135781 Last fiddled with by LaurV on 2012-12-12 at 04:42 Reason: forgot the number, grrr...

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post philmoore FermatSearch 345 2021-11-30 04:30 Batalov Factoring 149 2017-02-20 12:06 pepi37 Conjectures 'R Us 4 2015-10-09 14:49 siegert81 Factoring 1 2011-09-05 23:00 Citrix Math 35 2007-01-23 23:17

All times are UTC. The time now is 09:26.

Thu Dec 9 09:26:07 UTC 2021 up 139 days, 3:55, 0 users, load averages: 1.12, 1.01, 1.07

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.