The robots are at it again, and this time they’re solving, and breaking(?), math and cryptography! Things have been happening in the lattice corner including new leapfrogging complexity results in the closest vector problem (CVP), AND a possible poly-time quantum attack against the dihedral coset problem (DCP) that made everyone freak out for about a week (UPDATE: looks like it’s busted: https://eprint.iacr.org/2026/1693). ALSO, there was an important distinguisher attack against Classic McEliece, which on its face doesn’t sound like a big deal, unless you’re familiar with the track record of efficient distinguishers in the history of code-based cryptography… 😱

To help us make sense  of all this we are joined again by OG friend of the pod Chris Peikert! We had trouble with his audio but tried our best to fix it, apologies.

Transcript: https://securitycryptographywhatever.com/2026/08/26/ai-lattice-proofs-with-chris-peikert/

Links:
- https://openai.com/index/ten-advances-in-mathematics/
- https://cdn.openai.com/pdf/ten-proofs-oai.pdf
- https://x.com/ChrisPeikert/status/2083534770403750025
- https://bsky.app/profile/chrispeikert.bsky.social/post/3msp3boueis2z
- https://en.wikipedia.org/wiki/Boolean_satisfiability_problem
- https://knowyourmeme.com/memes/wordcel-shape-rotator-mathcel
- Chen 2024: https://eprint.iacr.org/2024/555
- https://eprint.iacr.org/2026/1630
- https://eprint.iacr.org/2026/1693
- CVP within n^(1/2-ɛ) -  : https://eprint.iacr.org/2026/1655

"Security Cryptography Whatever" is hosted by Deirdre Connolly (@durumcrustulum), Thomas Ptacek (@tqbf), and David Adrian (@dadrian)