@durumcrustulum, @tqbf, @davidcadrian. “Freewheelin’ dynamic”.
Joined August 2021
- Tweets352
- Following3
- Followers1.8K
- Likes405
Pinned Tweet
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 😱
youtu.be/7_Db0LXQrk0
Security Cryptography Whatever retweeted
New update to cryptoconspiracybench.org/!
Anthropic - 2
Everybody Else - 0
Claude and @avhwl also found that Skipjack cipher's s-box is generated by srand48(48571) plus some swaps.
Security Cryptography Whatever retweeted
CLAUDE FOUND THE SEEDS
anthropic.com/research/ecdsa…
Security Cryptography Whatever retweeted
Dammit, now I owe money to charity.
CLAUDE FOUND THE SEEDS
anthropic.com/research/ecdsa…
Security Cryptography Whatever retweeted
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.
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 😱
youtu.be/7_Db0LXQrk0
Security Cryptography Whatever retweeted
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.
securitycryptographywhatever…
Security Cryptography Whatever retweeted
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
Security Cryptography Whatever retweeted
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.
Security Cryptography Whatever retweeted
WOW!! 🤯
Among many jaw-dropping results, this proves NP-hardness of the Closest Vector and Nearest Codeword Problems for *polynomial* approximation factors, for the first time ever, and via a totally new approach (Reed-Solomon techniques). Amazing!
yes, nonsofic groups exist: this statement is one of many new beautiful results proved by Astra, our next major model.
We're releasing 10 such Astra proofs, complete with lean certificates and CoT walkthroughs for each of them. The results are wide-ranging, from von Neumann algebras (disproof of Connes' Rigidity Conjecture) to better bounds for high dimensional sphere packing, for circuit complexity, for monochromatic triangles in multicolored graphs, and more.
More thoughts here: openai.com/index/ten-advance…
Security Cryptography Whatever retweeted
Lattice cryptography has been studied considerably more than elliptic curve cryptography was at the time it was standardized.
We're doing another happy hour in Vegas. securitycryptographywhatever…
NEW EPISODE!
We invited Mark Schultz-Wu on the podcast to talk about the history of lattice cryptography. When lattices are explained in plain english, they are actually quite simple! I don’t think any of us have ever seen Deirdre so happy.
youtube.com/watch?v=1ey89_kW…
