Polynomial-Time Quantum Algorithm Proposed for Lattice-Based Cryptography [pdf] (archive.cr.yp.to) 5 points by namjh 1mo ago ↗ HN
[–] u1hcw9nx 1mo ago ↗ If that result holds, ML-KEM, FALCON, FHE schemes would all stop being PQ algorithms. Back to the drawing board.ps. The author seems to be Simon's problem Simon https://en.wikipedia.org/wiki/Simon%27s_problem [–] SuchAnonMuchWow 1mo ago ↗ I though LWE and SVP were NP-hard. Doesn't breaking them mean NP is in BQP, and thus classical computer encryption is entirely broken with quantum computers ?How would we recover from this back to the drawing board ?
[–] SuchAnonMuchWow 1mo ago ↗ I though LWE and SVP were NP-hard. Doesn't breaking them mean NP is in BQP, and thus classical computer encryption is entirely broken with quantum computers ?How would we recover from this back to the drawing board ?
2 comments
[ 6.8 ms ] story [ 42.4 ms ] threadps. The author seems to be Simon's problem Simon https://en.wikipedia.org/wiki/Simon%27s_problem
How would we recover from this back to the drawing board ?