tech βοΈ Amazon quantum algo could shake up PQC theory
A preliminary paper from an Amazon Web Services cryptographer introduces a polynomial-time quantum algorithm for the Dihedral Coset Problem. This research comes from Daniel R. Simon of AWSβ Cryptography Group. The paper claims this method could lead to polynomial-time quantum algorithms for approximations of the Shortest Vector Problem. This suggests some lattice problems might be easier for quantum computers than previously thought. The implications are primarily complexity-theoretic, not an immediate attack on current systems. π‘