Welcome • User Guide
ToS • Privacy • Canary
Donate • Bugs • License

©2024 Poal.co

883

Everyone is saying that quantum computers are going to break RSA encryption. But what if they will never exist and the ones that "do exist" with too little power to do that don't exist at all and it's just propaganda to get people to ditch RSA?

Why? Two reasons.

RSA is maybe too strong and the government realized they let a useful tool out of pandora's box to allow people to keep secrets from them.

Second, some processes in Elliptic Curve cryptography (the alternative to RSA for asymetric cryptography) can support secret private keys. Just like RSA our private key is based on two other randomly selected numbers. But the "algorithm" it runs on depends also on two other parameters that often are suggested by the NSA or some other organization. So really the cryptographic system runs with 4 parameters, two of whom are selected by the NSA, but instead of calling it a parameter we call it a separate algorithm. The problem is for some applications there is a way, if you know some difficult to know very large number, to break the encryption. And you can calculate the right elliptic curve parameters if you pick the large number first.

So perhaps, quantum computers will never exist, and they are just a form of propaganda to push more people to use NSA breakable encryption and force it as a standard. The forcing of a standard is key. Even if you have the insight to want to use something better, you have to communicate in the standards that allow you to talk to others. You can end up forced to use an NSA breakable encryption if the NSA can have an influence on what the standards are.

Everyone is saying that quantum computers are going to break RSA encryption. But what if they will never exist and the ones that "do exist" with too little power to do that don't exist at all and it's just propaganda to get people to ditch RSA? Why? Two reasons. RSA is maybe too strong and the government realized they let a useful tool out of pandora's box to allow people to keep secrets from them. Second, some processes in Elliptic Curve cryptography (the alternative to RSA for asymetric cryptography) can support secret private keys. Just like RSA our private key is based on two other randomly selected numbers. But the "algorithm" it runs on depends also on two other parameters that often are suggested by the NSA or some other organization. So really the cryptographic system runs with 4 parameters, two of whom are selected by the NSA, but instead of calling it a parameter we call it a separate algorithm. The problem is for some applications there is a way, if you know some difficult to know very large number, to break the encryption. And you can calculate the right elliptic curve parameters if you pick the large number first. So perhaps, quantum computers will never exist, and they are just a form of propaganda to push more people to use NSA breakable encryption and force it as a standard. The forcing of a standard is key. Even if you have the insight to want to use something better, you have to communicate in the standards that allow you to talk to others. You can end up forced to use an NSA breakable encryption if the NSA can have an influence on what the standards are.

(post is archived)

You are currently inside a comment thread.
Click here to see all the comments (4).
[–] • 1 pt (edited )

Yes.

So it's a computer where you can input either one or multiple inputs for the same parameter, and get multiple results out.. until it is read, and you get a single result that is a selection of the outputs. But that's only if read. You can chain operations. So the multiple outputs can be the multiple inputs to a second process. But in the end when you pass it to a conventional computer you will only get one answer, unless you want to poll it multiple times for answers.

So it's supposed to be handy where a parallel process is supposed to conclude with a single result.

It's supposed to be good at executing shor's algorithm, which is used to find prime factors to really large numbers. It uses the polling. In shor's algorithm we have to search for some value of p. And we can supposedly get a quantum computer to produce an output of every multiple of p. So we can poll it multiple times. Get a few answers. And then find the common factor of that. Basically that p is paired with a guess and it can tell us a better guess, which when we do that iteratively, gives us the correct guess within a few guesses.

Basically shor's algorithm turns a searching problem for g into a searching problem for p. That doesn't help out conventional computers because you still have a searching problem. But apparently p can be found in one execution of a quantum computer, plus the few extra reads needed.

If they ever develop warm quantum computers reads can also happen in parallel too.

[–] • 0 pt

i dont understand any of this. is it like when you enter 1+1, another part of the computer calulates it as 1+2, and yet another part calculates it as 1+3... all the way up to 1+999999999 ? and when you read it out by the computers port #500000000 it already knows the answer is 500000001 ? so it cracks the encryption by only knowing the hash?