MIT and Google Cryptographers Refute Daniel Simon's Claimed Quantum Attack on the Lattice Problems Behind ML-KEM
Daniel R. Simon of AWS claimed a polynomial-time quantum algorithm for the dihedral coset problem, a result that would have reached the lattice mathematics underneath ML-KEM. Aparna Gupte, Seyoon Ragavan and Mark Zhandry answer with an impossibility proof: the algorithm, and every design like it, leaves key recovery at random guessing. We read what the three-week episode means for post-quantum cryptography migration and the program offices behind it.
Sixty Hours of AI Cryptanalysis Retired the Hawk Signature Scheme
An Anthropic frontier model found a hidden lattice symmetry that roughly halves the lattice dimension needed to attack Hawk, and the team withdrew the scheme from NIST's process a day later. AI-assisted cryptanalysis is now a working method, with direct consequences for post-quantum cryptography buyers and the case for crypto-agility.