mersenneforum.org Another factor algorithm using lattice reduction
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2021-08-24, 13:29 #1 Till     "Tilman Neumann" Jan 2016 Germany 13×37 Posts Another factor algorithm using lattice reduction Hi all, yesterday I found the following article: https://arxiv.org/ftp/arxiv/papers/1308/1308.2891.pdf It claims to present the fastest deterministic integer factoring algorithm, having complexity O(N^1/6+ε). Like Schnorr, the author is relying on lattice reduction methods. Last fiddled with by Till on 2021-08-24 at 13:47 Reason: inserted exp operator
 2021-08-24, 14:03 #2 charybdis     Apr 2020 22·137 Posts This paper looks sloppily written and uses some unconventional terminology, eg "largest integer function" for what I presume is the floor function. More recent papers on the topic do not reference it. That should be enough to tell us that it's flawed. There may well be multiple errors; one conspicuous one is in equation (7), where the author seems to have cancelled out N with (floor(√N))^2. Of course if these two were equal then N would be square and we wouldn't be trying to factor it! It should also be noted that these algorithms are only of theoretical interest at present, because QS and NFS, while technically non-deterministic, are much faster and almost always work in practice. Last fiddled with by charybdis on 2021-08-24 at 14:05

 Similar Threads Thread Thread Starter Forum Replies Last Post Zhangrc Marin's Mersenne-aries 3 2021-08-15 13:36 BenR Computer Science & Computational Number Theory 2 2016-03-27 00:37 fivemack Computer Science & Computational Number Theory 15 2009-02-19 06:32 Prime95 PrimeNet 3 2008-11-17 19:57 R.D. Silverman Factoring 2 2005-08-03 13:55

All times are UTC. The time now is 01:14.

Thu Dec 9 01:14:07 UTC 2021 up 138 days, 19:43, 0 users, load averages: 2.20, 1.68, 1.46