mersenneforum.org > Math An Analytic Approach to Subexponential Factoring
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2009-12-11, 13:47 #1 akruppa     "Nancy" Aug 2002 Alexandria 46438 Posts An Analytic Approach to Subexponential Factoring Francesco Sica De Factorisatione Numerorum I : An Analytic Approach to Subexponential Factoring http://arxiv.org/abs/0912.1585 Alex Last fiddled with by akruppa on 2009-12-11 at 13:48
2009-12-11, 17:17   #2
R.D. Silverman

Nov 2003

164448 Posts

Quote:
 Originally Posted by akruppa Francesco Sica De Factorisatione Numerorum I : An Analytic Approach to Subexponential Factoring http://arxiv.org/abs/0912.1585 Alex
If this thing is real, it is a significant advance, because it
gets rid of the (log log N)^(1-alpha) term in the exponent
for the time complexity of existing algorithms.

e.g. NFS runs in time exp( (1+o(1))( (log N)^1/3 (loglog N)^2/3))

this advance would get rid of the (loglog N)^2/3. ---> A big theoretical
speed improvement.

If it works. If it is practical.

2009-12-11, 18:05   #3
R.D. Silverman

Nov 2003

22×5×373 Posts

Quote:
 Originally Posted by R.D. Silverman If this thing is real, it is a significant advance, because it gets rid of the (log log N)^(1-alpha) term in the exponent for the time complexity of existing algorithms. e.g. NFS runs in time exp( (1+o(1))( (log N)^1/3 (loglog N)^2/3)) this advance would get rid of the (loglog N)^2/3. ---> A big theoretical speed improvement. If it works. If it is practical.
I will read the paper over the weekend. It is a genuine effort.

 Similar Threads Thread Thread Starter Forum Replies Last Post Mark Rose PrimeNet 6 2017-05-23 23:58 Erkan PrimeNet 7 2017-01-10 03:34 Mini-Geek Information & Answers 14 2010-11-14 16:16 boothby Factoring 10 2009-10-16 17:24 ThiloHarich Factoring 0 2009-08-18 16:48

All times are UTC. The time now is 11:07.

Tue May 11 11:07:37 UTC 2021 up 33 days, 5:48, 1 user, load averages: 2.51, 2.28, 2.09