News for hackers. Stuff that matters.
Re:A New Provable Factoring Algorithm by ColinWright on Thursday October 23, 2014 @06:08AM (#8497414)
The following is general, and may be wrong in some details. I look forward to someone more knowledgeable than I coming along to fix it to be totally correct, but here are some of the ideas.

    The unprovable algorithm usually use randomness
    and/or rely for their correctness on unproved
    hypotheses, ...
As an example, some algorithms rely on the Riemann Hypothesis for their correctness.

    ... yet are observed to be the fastest in practice
    for numbers of substantial size.
The Pollard Rho algorithm is not a fast one, running in expected time proportional to the square root of the factor found, which is usually (but not always) the smallest factor. however, this effectively relies on the birthday problem, and is only a heuristic, not proven. It's also not guaranteed to factor the number at all.

    The provable algorithms are usually deterministic,
    but their key feature is that their correctness is
    unconditional. 
And their run time is proven without using unproven hypotheses.
Re:A New Provable Factoring Algorithm by pbsd on Thursday October 23, 2014 @08:46AM (#8497826)
Nitpick: Pollard's rho is unproven not because it relies on the birthday paradox, but because there's no way to prove that f(x) = x^2 + a behaves like a random walk. It may not because, e.g, the length of the cycle may be the same for every prime divisor of the number being factored.

Similarly, the complexity of the quadratic sieve is heuristic because there is no known way to prove that (sqrt(n) + i)^2 - n results in the same distribution of smooth integers than that of a random sequence of the same size. Dixon's algorithm [1] turns the quadratic sieve provable (but much slower in practice) by sampling randomly instead of sequentially. Sieving is thus no longer possible, but we get a subexponential running time of L_n[1/2, 2 sqrt(2)]. The hyperelliptic curve factorization algorithm [2, 3] is another probabilistic but provable algorithm with a more efficient but not provable counterpart, the elliptic curve method [4].

The blog post only seems to care about deterministic factoring algorithms, though. There are indeed no known deterministic factorization algorithms with better than exponential complexity.

[1] http://www.ams.org/journals/mcom/1981-36-153/S0025-5718-1981...

[2] https://math.dartmouth.edu/~carlp/hyperI.pdf

[3] https://math.dartmouth.edu/~carlp/PDF/paper129.pdf

[4] https://openaccess.leidenuniv.nl/bitstream/handle/1887/3826/...

Re:A New Provable Factoring Algorithm by Sniffnoy on Thursday October 23, 2014 @05:25PM (#8500846)
Huh -- I had always assumed when people talked about e.g. GNFS being the fastest known, they meant proven. I had no idea about this, thank you.
Re:A New Provable Factoring Algorithm by ColinWright on Thursday October 23, 2014 @08:53AM (#8497843)
Perfect - thank you.