News for hackers. Stuff that matters.
Re:Quantum Algorithms for Lattice Problems by Ar-Curunir on Friday April 12, 2024 @12:37PM (#40014836)
The running time of attacks hasn't suddenly become O(n^4.5). The latter figure describe the noise ratio for which the LWE assumption becomes broken in quantum polynomial time.

The proposed post-quantum encryption schemes use a much smaller noise ratio which (at the moment) is not affected by these attacks.

Re:Quantum Algorithms for Lattice Problems by da-bacon on Friday April 12, 2024 @04:02PM (#40017054)
I didn’t say the runtime did I? The approximation ratio went from exponential to polynomial noise ratio. This just went from 2^n to n^4.5 and everyone seems to say “oh this is fine”.
Re:Quantum Algorithms for Lattice Problems by Ar-Curunir on Friday April 12, 2024 @08:20PM (#40019071)
The attackable noise ratio did not go from exponential to polynomial either. It went from classically subexponential to quantumly polynomial.
Re:Quantum Algorithms for Lattice Problems by da-bacon on Saturday April 13, 2024 @07:33AM (#40022388)
Yes sub exponential which is splitting hairs. Exp(O(n log log n / log n)). Thanks for the acknowledgment that I didn’t say runtime.