Posts
Forging 1024-bit RSA signatures in nearly SNFS time
AMD's random number generator can't generate a 0
Structural Weaknesses in 7 NGCC Submitted Hash Functions
Nearly SNFS-Speed Signature Forgery Sans Factoring N (NSNFSSSFSFN)
TLS is 65% post-quantum now and it's the least important thing we could have fixed
Cloudflare says about two thirds of the human traffic on their network is already PQ. Google put a 2029 date on finishing their migration. Every PQ readiness writeup this month leads with those two numbers like the job's mostly done. I think the numbers are real and the framing is …
Urna Aberta — a clean-room e-voting machine simulator (Python) / um simulador clean-room de urna eletrônica
**EN:** Every election, Brazil replays the same fight about its voting machines — one camp calls it a magic tamper-proof box, the other calls it open fraud. Most of both have read zero lines of code. So I wrote my own. **Urna Aberta** is a clean-room model — my code, …
RSA-896
Improved McEliece Key Recovery
Two papers showing improved key recovery methods for Classic McEliece just appeared on eprint, both also show a solution to one of the key recovery challenges. [https://ia.cr/2026/1984](https://ia.cr/2026/1984) [https://ia.cr/2026/1986](https://ia.cr/2026/1986)
Arxiv - Crossing the Streams: SSH Plaintext Recovery via a Common Compression Context in Multiplexed Channels
How much optimization before publishing (eprint) a protocol?
I'm writing up a paper on a new protocol. The approach is different from previous attempts to solve the same problem, and this makes me want to write up the simplest version possible to elucidate the idea. However, there's like a half-dozen places that jump out as either optimizable or …