
AWS Quantum Claim Challenges Lattice-Crypto Foundations
An AWS cryptography researcher’s preprint claims a polynomial-time quantum algorithm for the Dihedral Coset Problem, which could theoretically enable efficient solutions to lattice problems underpinning post-quantum cryptography. The work is preliminary and theoretical, does not attack deployed standards or estimate hardware needs, and will require independent peer review to verify its correctness, practicality, and implications for real-world cryptography.













