Security Cryptography Whatever

AI Proofs Close In on the Square-Root Barrier, Worst-Case Lattices Still Safe

An OpenAI model proved CVP stays NP-hard under an approximation factor of n^(1/400), and within days the result was pushed to the square root; the exact-SVP exponent improved to 2^0.7n and McEliece took a quasi-polynomial attack, yet real-world lattice crypto is safe for now thanks to dimension blowup and the gap in approximation factors.