Damus

Recent Notes

Daniel J. Bernstein · 5w
Some energy numbers for breaking a post-quantum proposal, SIKEp751: https://eprint.iacr.org/2023/376 reports 11 seconds to break one key on a mass-market Intel Xeon Gold 6248R. That's a 200-watt CPU; ...
Stephan Neuhaus profile picture
@nprofile1q... These proposals are broken so quickly that it would be a good idea IMO to put the brakes on any attempt at standardising them. But if one absolutely must standardise, then at least standardise hybrids, for crying out loud.
1
Daniel J. Bernstein · 5w
nostr:nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpqpn3082tr4276sm3jq56f5crdcrtxkm805902a7xc7mut2pw4p6lsdz4nyz Well, the problem with _not_ rolling anything out is that then we're not even _trying_ to deal with the quantum risk. Hybrids (double encryption, double signatures) nicely resolve this ...
Taggart :ifin: · 6w
nostr:nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpqpn3082tr4276sm3jq56f5crdcrtxkm805902a7xc7mut2pw4p6lsdz4nyz Could I trouble you to explain that like I'm an English major?
Stephan Neuhaus profile picture
@nprofile1q... The article claims that factorisation takes exponential time, I.e., is proportional to e^(an) where a is a constant and n is the number of bits in the number to be factored. But that's not true: the best factoring algorithm known to date, the General Number Field Sieve, takes subexponential time. This class of functions grows faster than any polynomial, but slower than any exponential. One example of a subexponenrial function is e^(√n).
Taggart :ifin: · 6w
nostr:nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpqpn3082tr4276sm3jq56f5crdcrtxkm805902a7xc7mut2pw4p6lsdz4nyz Could I trouble you to explain that like I'm an English major?
Lilith Wittmann · 7w
nostr:nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpqpn3082tr4276sm3jq56f5crdcrtxkm805902a7xc7mut2pw4p6lsdz4nyz z.B. Dienstausweis einer Behörde. Oder der Reisepass.
Taggart :ifin: · 11w
Thought I'd compile this here so others can take advantage of it. As of 2026-03-02, the state of the art in quantum decryption has cracked a: 22-bit RSA key 6-bit elliptic curve key https://forklog...
Stephan Neuhaus profile picture
@nprofile1q... A followup on this one. Turns out that Shor needs so many qubits because it needs to compute x^r mod n for all r in range 1..n-1. Shor does this with quantum magic and lots of qubits.

The giant reduction in qubits for the claimed breakthrough is that they compute these classically and then load them up into the quantum computer. Of course that saves on qubits, but only at the expense of exponential running time. So, not actually a breakthrough, just more trickery.
1
Stephan Neuhaus · 7w
nostr:nprofile1qy2hwumn8ghj7un9d3shjtnyd968gmewwp6kyqpq7yf7cxzxz4kwf24zmflvyqqtrylsjwm5q9a074u5ger57rmzz0aqe544dh Not my discovery, BTW. I have this from a blog by quantum computing professor Scott Aaronson https://scottaaronson.blog/?p=9615
Lilith Wittmann · 14w
All billionaires are trash. This includes Hetzner-Martin and Schwarz-Dieter.
Stephan Neuhaus profile picture
@nprofile1q... And that's where a lot if the digital sovereignty discussion goes wrong. We should not replace one set of tech monopolies (and accompanying tech billionaires) with another, that would solve exactly nothing. Instead we need robust antitrust and privacy laws, with teeth, and support for open standards. For a start.

The problem is not mainly technological and therefore can't be solved by merely exchanging Office365 with, say, NextCloud. (I like NextCloud!)