NEW EPISODE!
The gang talks about what AI getting Good At Math™ might mean for cryptography, & why public-key cryptography probably isn’t ending. David is on a mission to civilize and claims a crisis of empiricism.
https://t.co/uvEYK1AsKF
https://t.co/lMoiM9R1IK
So 3SAT is subexponential but still hard?
*flips around chair*
Brother, let me tell you about some other subexponential problems that are still hard
New episode of @SCWpod ! https://t.co/DCpdnIQHyD
NEW EPISODE!
Lattices! New results in the closest vector problem & possible poly-time quantum attack against the dihedral coset problem that made everyone freak out for about a week; ALSO there's a distinguisher attack against Classic McEliece 😱
https://t.co/nHDz0Mqn4H
We had fellow Michigan Man @ChrisPeikert on the podcast.
Since the last time Peikert was on, Michigan won a national championship in both football and basketball.
This is the new bar for repeat guests.
Fans of Deirdre and David (and Chris Peikert, of course) will be psyched: the rare SCW episode where I get not one single line in. Theoretical advances for lattices and McEliece, this week on Security Cryptography Whatever.
https://t.co/qn1BfclHg5
I wrote a post about how security undervalues preventing problems, and how this can be exasperated by AI and the vulnpocalypse, even though AI should actually make robustness much easier for defenders
Achievement unlocked: recorded an episode of Security Cryptography Whatever where I had not only not one good minute, but not one interjection. A blessedly me-free episode with Chris Peikert, coming soon.