undefined | Better HN

0 pointsDarkmSparks3y ago0 comments

>but it certainly makes sense to get ahead of it.

Assuming they will exist.

And assuming there exists math that can't be solved easily by quantum computers that solve all math solution finding problems easily.

Surely it makes no sense to adopt encryption no one but a few individuals of questionable motives understand, to protect against a technology that is a long way from even proven yet. IMHO.

Anything else requires several leaps of faith that should be no where near "in use" encryption - research is of course a very different story, but stories like this are hardly confidence inspiring.

0 comments

jabbany3y ago

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 found. FWIW the way existing traditional crypto is proven safe is pretty much the same -- get a bunch of people to work on attacks and weed out the bad stuff.

DarkmSparksOP3y ago

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.

jabbany3y ago

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?

DarkmSparksOP3y ago

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 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.

1 more reply

j / k navigate · click thread line to collapse

0 comments

jabbany3y ago

DarkmSparksOP3y ago

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.

jabbany3y ago

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?

DarkmSparksOP3y ago

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 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.

1 more reply

j / k navigate · click thread line to collapse