Factoring semi-primes with (quantum) SAT-solvers — mentioned by NoKnowledge

Thu, 07 May 2020 14:32:04 GMT

That is apples to oranges, you're citing a lattice reduction algorithm? Maybe you meant the number field sieve https://en.wikipedia.org/wiki/General_number_field_sieve? In that case the answer is: never. We've tried to generously interpret earlier factoring annealing results (there is nothing new in the top-posted paper) and had to conclude that the overall method just doesn't scale well: https://arxiv.org/abs/1902.01448

Paper and discussion history. A mention is not an endorsement.

Factoring semi-primes with (quantum) SAT-solvers — mentioned by NoKnowledge

Thu, 19 Sep 2019 15:17:57 GMT

It's strange that the authors pick integer factorization as the problem to solve on their machine. Although their machine may provide a speedup for optimization problems, these speedups are not relevant for the problem of integer factorization, as shown in https://arxiv.org/abs/1902.01448 (disclaimer: I am a co-author of that paper). Skimming over the paper it seems their method of translating factorization to the optimization problem consists of simplifying equations without justification that this can be done efficiently. I suspect that their preprocessing step is already NP-hard. The…

Paper and discussion history. A mention is not an endorsement.

Factoring semi-primes with (quantum) SAT-solvers · HackerPapers discussions

Factoring semi-primes with (quantum) SAT-solvers — mentioned by NoKnowledge

Factoring semi-primes with (quantum) SAT-solvers — mentioned by NoKnowledge