
This is tomorrow at 12:00 PT at The Gateway, Room 5370 at UC Berkeley. Come by and learn about cryptography standards. security.cs.berkeley.edu/sem… I'll be in the bay area for a few weeks, so let me know if you want to meet up and talk tech!

Software engineer at @anthropicai interested in cryptography, security, privacy, and machine learning.

This is tomorrow at 12:00 PT at The Gateway, Room 5370 at UC Berkeley. Come by and learn about cryptography standards. security.cs.berkeley.edu/sem… I'll be in the bay area for a few weeks, so let me know if you want to meet up and talk tech!

I'm giving a talk today (Weds) about the HOVER McEliece attack ( IACR ePrint 2026/1778 ) at NORDSEC in Aarhus. I have 30 minutes; can even describe McEliece itself! Slides already here: mjos.fi/doc/20261111-nordsec…

"Fan Factories: Multiple Number Fields in Factorization Factories and Batch NFS" draft from Google Deep Mind to improve factoring: storage.googleapis.com/deepm…


"Kaiburr: ML-KEM at (much) higher security" eprint.iacr.org/2026/2730

History is made as AES is projected to be the first block cipher elected to the United States Senate.

Anthropic is releasing an open source library, FlashProve, for provable inference. It was measured on Llama 4 Maverick, a 400B-parameter mixture of experts model. Code: github.com/anthropics/FlashP… Blog post: anthropic.com/research/prova…

My comment to @neilirwin about 20 CEA staff being replaceable by AI generated discussion. My followup essay on the issue & what it means for the future of work, training and the pipeline. We shouldn't avert our gaze from the tough issues we face. econvitals.org/posts/2026-11…

Cybersecurity awareness month, you can stop. We get it.

Elliptic curves are not generic. Long time coming. Congrats @crypto_theory and collaborators github.com/bochum-crypto/sub… What I said a week ago: It wouldn't surprise me in the least bit if there were a better factoring or discrete logarithm alg. For factoring: what is the chance that exp(n^1/3) is the right bound? who are we kidding? For discrete log over finite fields: better algorithms over Z_p have followed a decade or so behind those for small-char fields (Coppersmith'84 vs NFS a decade-ish later). Joux gave a quasi-poly alg over small-char fields in the 2010s. Porting to finite fields long overdue. For discrete log over elliptic curves: assuming that elliptic curve groups were "generic" is particularly preposterous given the rich structure they have. All of these ripe for disruption. Unstructured LPN would take me by real surprise, also unstructured LWE to a slightly lesser extent.


My [un]prompted II talk slides: "Math Ability has Consequences – AI Cryptanalysis" available here: mjos.fi/doc/20261028-unp2-ma… (October 28, 2026). Had 20 minutes, so I concentrated on the Classic McEliece story + ngcc.dev stuff.

“The core algorithm was found on October 16 by an internal Claude research model with 14M output tokens and no human input. Anthropic researchers worked with Claude to improve the presentation, resulting in this paper.” github.com/anthropics/formal…

"Everybody Is Losing Their Minds About AI Math And Crypto" by @SCWpod : securitycryptographywhatever…

