Talk:Fermat's factorization method: Difference between revisions

Revision as of 01:17, 2 December 2012

Revision as of 07:43, 3 December 2012

Line 22:

Conclusion:

Hence irrespective of the difference there exist Best Fermat Factors, so that factorization complexity is easy. The logic that odd composite with least difference will be factored easily and large difference would factored hardly is wrong. Hardness is depends upon the how much the factors are deviated from the Best Fermat Factors. And i had a new methodology to factorize the given number based on above properties. <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Yourskadhir|Yourskadhir]] ([[User talk:Yourskadhir|talk]] • [[Special:Contributions/Yourskadhir|contribs]]) 01:15, 2 December 2012 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->

== Mod 16 optimization ==