Tjerand Silde

@tjesi.bsky.social

Associate Professor in Cryptology and Research Group Leader at the NTNU Applied Cryptology Lab in Trondheim, Norway. Homepage: https://tjerandsilde.no Research group: https://www.ntnu.edu/iik/nacl-lab

1/ Initial reactions after some hours with this groundbreaking result proving the NP-hardness of poly-approx CVP/NCP: It is most likely correct, but more importantly, it is original, elegant, and beautiful! (Also: it is easy to improve, quantitatively.) openai.com/index/ten-ad...

Ten advances in mathematics and theoretical computer science

OpenAI shares new results on long-standing open problems in mathematics and theoretical computer science, including advances in geometry, cryptography, and complexity.

openai.com

Some initial thoughts, and a complicated mix of feelings. Wow. I mean, Erdos problems are cool (I genuinely mean that), I didn't know about the Jacobian conjecture before it got disproved. But this newest batch from OpenAI hits home in a way the previous announcements did not.

"We're all worried," as what it means to do research (in my field, Theoretical CS) seems to be shifting, and shifting fast. What to do? Senior researchers must lead by example, knowing that not everything will pan out. What I'm suggesting below may not work everywhere, but here's my own advice: 1/

Every year we write about the exciting developments in post-quantum signatures. Last year didn't disappoint. But it's too late. As ekr wrote in 2024 "You go to war with the algorithms you have, not the ones you wish you had." ML-DSA will have to do for now. blog.cloudflare.com/ml-dsa-will-...

Why we cannot wait for better post-quantum signature algorithms

NIST is advancing nine new post-quantum signature algorithms as potential candidates for future standardization. We take a closer look at all of them, and argue that while they are in the works and sh...

blog.cloudflare.com

There are no technical or compliance reasons to double the size of symmetric keys in response to the threat of quantum computers. This common misunderstanding of Grover's algorithm risks wasting limited resources that should go towards deploying actually urgent post-quantum algorithms.

Quantum Computers Are Not a Threat to 128-bit Symmetric Keys

There is no need to update symmetric key sizes as part of the post-quantum transition, due to the details of how Grover's algorithm scales. Most authorities agree.

words.filippo.io

Two papers came out last week that suggest classical asymmetric cryptography might indeed be broken by quantum computers in just a few years. That means we need to ship post-quantum crypto now, with the tools we have: ML-KEM and ML-DSA. I didn't think PQ auth was so urgent until recently.

A Cryptography Engineer’s Perspective on Quantum Computing Timelines

The risk that cryptographically-relevant quantum computers materialize within the next few years is now high enough to be dispositive, unfortunately.

words.filippo.io

Har vært på leting etter snill, trygg og ikke-amerikansk telefon. Jeg fant ut to ting: 1) At det er umulig å komme helt i mål, og hvorfor 2) Hvorfor det likevel er verdt å forsøke Håper du vil lese! Artikkelen er også blitt en slags podkast i lydutgaven, et eksperiment, om du heller vil lytte

(+) Jakten på en fri, snill og akkurat passe dum telefon

Vi vil bli fri, bryte de mobile livene våre vekk fra tekoligarkene og overvåkningsgigantene. Og det har aldri vært flere europeiske alternativer. Skal det være en Mudita eller en Dumbdroid eller en Jo...

morgenbladet.no