Helger Lipmaa

@helger.bsky.social

Cryptography professor at the University of Tartu, Estonia. Zero-Knowledge. SNARKs.

We finally finished the universal signature forgery for 1024-bit RSA! 2^32 oracle queries, 1200 core years precomputation, 180 core years for an individual forgery, and 3 years of human labor (no AI involved) by Laura, Adam, Nadia, Emmanuel and me to pull of this computation against real HSMs.

Emmanuel Thomé@emmanuelthome.bsky.social · last wk.

Forging 1024-bit RSA signatures in nearly SNFS time Hand over your HSM for some time, and we can forge signatures for its key. Arbitrary signatures. Forever. github.com/ucsd-hacc/NS...

A different view. As a cryptographer (or maybe, as me - some cryptographers are in a different camp), I mostly agree with what @wtgowers.bsky.social is saying - my goal is to solve problems, and if AI does it better, then so be it. My problem is ethical. The way (say) OpenAI approaches it is wrong.

Timothy Gowers@wtgowers.bsky.social · 2w ago

I've written a blog post responding to the letter about maths and AI signed by 25 Fields medallists. As with the Leiden Declaration, I didn't sign it, but I agree with much of it and welcome its existence. gowers.wordpress.com/2026/09/17/w...

“Now Lean, particularly in Navier-Stokes papers, is being used as a time-stamp, a way to claim your theorem before having to write it up properly in an explainable way.” A sentence that would’ve been seen as the ravings of a madman just ~1 year ago. blog.computationalcomplexity.org/2026/09/navi...

Navier-Stokes and Lean

I was working on this week's post on Lean after reading Kevin Hartnett's book  The Proof in the Code: How a Truth Machine Is Transforming Ma...

blog.computationalcomplexity.org

Dancing very very VERY close to saying “OpenAI stole our almost-complete proof of Navier-Stokes from internal access to our ChatGPT sessions because they were desperate to scoop Anthropic” which is absolutely 100% a believable thing OpenAI would do right now cims.nyu.edu/~tristanb/st...

Bild

We asked an unreleased research version of Claude to take a stab at the Riemann hypothesis. It didn’t solve it, but it did make strides on a related problem: it increased the lower bound for the fraction of zeros of the Riemann zeta function that satisfy the hypothesis from 41.6% to 67.2%.

Learning more about Claude's mathematical capabilities

An unreleased version of Claude has made strides on a problem related to the Riemann hypothesis. It improved the lower bound for the fraction of zeros of the Riemann zeta function that satisfy the hypothesis, increasing it from 41.6% to 67.2%.

anthropic.com

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

New York University professor Hong Wang has won the Fields Medal for her work three-dimensional Kakeya set conjecture, inspired by a simple question that has puzzled mathematicians for more than a century. But what is a “Kakeya-type” problem?

A Once-in-a-Century Proof: The Kakeya Conjecture

A simple question about a spinning needle has haunted mathematicians for more than a century. It led to the Kakeya conjecture, a cornerstone of modern analysis connecting geometry, fractals, and the…

youtube.com