A Polynomial-Time Quantum Algorithm for the Dihedral Coset Problem (July 31, 2026)

This is seems noteworthy. It's from Simon.

Correct me if I'm wrong but the approximation factor of `sqrt(n)polylog(n)` means that current lattice cryptosystems would be in danger and not PQ-algorithms anymore.