Re:Breaking RSA Security with a Low Noise D-Wave 2000Q Quant...
by ganzuul on Thursday May 07, 2020 @01:31AM
(#23100014)
At what bit lenght is this approach faster than https://en.wikipedia.org/wiki/Lenstra%E2%80%93Lenstra%E2%80%... ?
[ Parent
| on HN ]
Re:Breaking RSA Security with a Low Noise D-Wave 2000Q Quant...
by NoKnowledge on Thursday May 07, 2020 @10:32AM
(#23103363)
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