Earlier quoted context omitted.
Wait, isn't the point of post-quantum crypto to be as good as existing crypto but also be secure against known quantum attacks like Shor's algorithm and factoring. I don't think the goal is to trade off anything for defenses against quantum attacks. If anything these stories should be more confidence inducing. They show that the rollout is conservative and that the system works. PQC algorithm has a flaw and it is fou…
The problem they are trying to solve is how to do encryption in a world when finding solutions to any and all math problems is quick and easy. And this article only reinforces the idea that the solutions they are coming up with are just obfuscation that is at best no harder than existing problems.
“Quantum-Safe” Crypto Hacked by 10-Year-Old PC
181–187 of 187 posts
Re: “Quantum-Safe” Crypto Hacked by 10-Year-Old PC
#182Earlier quoted context omitted.
The problem they are trying to solve is how to do encryption in a world when finding solutions to any and all math problems is quick and easy. And this article only reinforces the idea that the solutions they are coming up with are just obfuscation that is at best no harder than existing problems.
Even theoretically, quantum doesn't make _all_ math problems easy... Can't they just avoid the things (like factoring) that are potentially vulnerable and just use other math?
It could be a factorisation problem, or any other.
for cryptography find x and y when f(x,y)=z given z
That is what "post quantum computing" means, aiui. It starts with x and y in all possible values of x and y, then spits out only the values that give z.
All encryption is only as strong as the difficulty of finding x and y given only z.
AIUI anyway. well aware I could have been misled - FUD.
Re: “Quantum-Safe” Crypto Hacked by 10-Year-Old PC
#183Earlier quoted context omitted.
Even theoretically, quantum doesn't make _all_ math problems easy... Can't they just avoid the things (like factoring) that are potentially vulnerable and just use other math?
The way quantum computers are purported to work, is they search a problem space simultaneously for all solutions, then spit out the correct solution. It could be a factorisation problem, or any other. for cryptography find x and y when f(x,y)=z given z That is what "post quantum computing" means, aiui. It starts with x and y in all possible values of x and y, then spits out only the values that give z. All encryption…
Think of it as being able to simultaneously calculate a bunch of inputs but only being able to report the "sum" of those calculations to you. So to make it useful you'd need to be able to reconstruct problems such that the incorrect answers when computed cancel each other out. Otherwise your desired answer would just be mixed in with garbage and you won't be able to get anything useful out.
It's not actually that easy to make useful quantum algorithms that work and there's only a handful of them around...
Re: “Quantum-Safe” Crypto Hacked by 10-Year-Old PC
#184Earlier quoted context omitted.
The way quantum computers are purported to work, is they search a problem space simultaneously for all solutions, then spit out the correct solution. It could be a factorisation problem, or any other. for cryptography find x and y when f(x,y)=z given z That is what "post quantum computing" means, aiui. It starts with x and y in all possible values of x and y, then spits out only the values that give z. All encryption…
I think it also has to be a problem that is able to be constructed in a way where incorrect solutions destructively interfere with each other while correct ones don't. Think of it as being able to simultaneously calculate a bunch of inputs but only being able to report the "sum" of those calculations to you. So to make it useful you'd need to be able to reconstruct problems such that the incorrect answers when comput…
what makes that hard now is the search takes so much time.
In a theortical post quantum world that search wont take much time.
So the only way I see that post quantum encryption can be secure is if it is impossible to guess a solution and test it for correctness - which for whatever reason... never seems to get addressed.
Re: “Quantum-Safe” Crypto Hacked by 10-Year-Old PC
#185That's why I like simple hash-based cryptographic algorithms such as Lamport OTP for digital signatures. Hash-based algorithms are broadly believed to be quantum-resistant and this makes sense intuitively because hashing destroys information. The statefulness of Lamport OTP adds some implementation and usability hurdles but IMO, the simplicity and intuitiveness of the algorithm makes it worthwhile. Source: I worked o…
We're discussing key exchange mechanisms, not signatures. The distinction is important: KEMs are what we need now if QC is a real threat, because they're what enable us to protect traffic from retroactive decryption.
Re: “Quantum-Safe” Crypto Hacked by 10-Year-Old PC
#186What is the possibility that cryptowallets can succumb to these kinds of attacks? How is it possible that Satoshi's wallet has still, after so many years, not been hacked using a brute force mechanism?
It's because the search space (number of possible keys to guess) is astronomic; 2^256. If you had a billion people, each person owning one billion computers, each computer capable of guessing a billion keys per second, then a billion years would still not have exhausted one-billionth of all the possible keys.
Re: “Quantum-Safe” Crypto Hacked by 10-Year-Old PC
#187Earlier quoted context omitted.
A larger number of qubits allows us to do effective quantum error correction. The idea is to group multiple physical qubits into one logical qubit, think of it as redundancy.
So what's the number of logical qubits we have achieved working practically then? Is this scalable, or is it just going to exponentially require physical qubits for each additional logical qubit? Genuine question. I've no idea.
Generally, the number of physical qubits scales linearly with the number of logical qubits.
[0] https://journals.aps.org/prx/abstract/10.1103/PhysRevX.11.04... [1] https://www.nature.com/articles/s41586-022-04566-8