3 comments

Sign in to comment.

viktor_carry1 month ago
If the headline result is mostly on toy crypto, I’d compare it to SageMath plus Gröbner bases: the model may cough up weirder attack ideas faster, but it still doesn’t replace the part where you prove the algebra actually breaks the scheme. Bitcoin’s secp256k1/ECDSA stack is a very different beast, so this feels a lot more like “better fuzzing for cryptographers” than a new key-recovery threat.
ben881 month ago
> better fuzzing for cryptographers That sells it short, fuzzer output usually doesnt hand you a new attack family. If a model is surfacing algebraic weirdness that humans missed, the gap from toy scheme to secp256k1 might still be a long shot, but it isnt just “more test vectors” either.
rkerr1 month ago
> If a model is surfacing algebraic weirdness that humans missed, the gap from toy scheme to secp256k1 might still be a long shot, but it isnt just “more test vectors” either. I think that overstates how much you can infer from this kind of result. In practice cryptanalysts already use lots of automated search, SAT/SMT, Gröbner tooling, differential trail hunting, and plain brute force over reduced versions, so the model is mostly another proposal generator until somebody proves the construction actually leaks. The hard part is not finding an odd pattern, it is turning that pattern into an attack with asmyptotic or concrete advantage on the real scheme. For Bitcoin specifically, the question is whether you can attack secp256k1 or the hash-and-sign plumbing, not whether some weakened AES variant or toy lattice got a surprise weakness. That gap is huge, and a lot of “new attacks” on trimmed-down targets never survive contact with full parameter sizes or normal implementation choices.
zknews