News for hackers. Stuff that matters.

A comment on Factoring may be easier than we think (2016). Parent comment

Re:Factoring may be easier than we think (2016) by jasonhansel on Sunday June 30, 2019 @01:06PM (#20319176)
But what if you find an algorithm with a low asymptotic complexity, but with such a high constant factor that it could not be put into practical use? We would still want to move away from RSA (since constant factors can often be improved), but there would be no way to actually use the algorithm in its current form.
[ Parent | on HN ]
Re:Factoring may be easier than we think (2016) by rocqua on Sunday June 30, 2019 @06:12PM (#20320890)
In that case, there is no immediate threat when publishing. Unless you area afraid someone else can improve on the constant factor, this won't break crypto.
[ Parent | on HN ]
Re:Factoring may be easier than we think (2016) by jasonhansel on Sunday June 30, 2019 @07:35PM (#20321286)
> there is no immediate threat when publishing.

Unless someone else comes up with the same algorithm, and does lower the constant factor.

[ Parent | on HN ]
Re:Factoring may be easier than we think (2016) by Ar-Curunir on Sunday June 30, 2019 @06:37PM (#20321014)
Cryptography research moves very fast =)
[ Parent | on HN ]