Skip to main content
1 vote

Finding Prime Factors of a number in $\log(n)$

No. The best currently known general factoring method, GNFS, takes far longer. You can't even do a probable-primality test in that amount of time. Let's get notation straight for a moment. You have a ...
Charles's user avatar
  • 32.2k

Only top scored, non community-wiki answers of a minimum length are eligible