quantum cryptography and vpn

[JSD 6]

Respectfully, quantum computing does not exist. All claims of quantum computing have proven false. And even if they did exist, they could at worst reduce the amount of work to half the amount currently required. And if every computer ever made worded together for a billion years, the odds are they could not break one single 256 bit key.

 

So to hell with the FUD. (Fear, Uncertainty, and Doubt.) Encryption is only weak if you rely on antiquated methods.

 

It seems that this is not completely correct. (I am not an expert for cryptography but just depict what I read in reputable sources.)

 

Apparently, there have been considerable advances with quantum computers in recent years, and many experts now seem to believe that large effective QCs will be there in the forseebale future:

 

https://www.itworldcanada.com/article/encryption-breaking-quantum-computers-getting-closer-warns-canadian-expert/396496

 

Further, while symmetric ciphers with long keys (like AES-256) will still be quite safe, the public-key cryptography we're using today (e.g. RSA and elliptic curves for key negotiation) will be broken with a large-scale quantum computer:

 

"For example, the Advanced Encryption Standard, approved by the United States government, has up to 2²⁵⁶—or about a 1 followed by 77 zeros—keys. A quantum computer could make that same search as if there were only 2¹²⁸ keys—about a 3 followed by 38 zeros. On the one hand, that’s a lot faster. On the other hand, it’s still an awful lot of searching to do.

...

Unfortunately for RSA, not all one-way functions are created equal. The factoring problem falls into a category known as “hidden subgroup problems.” A group is a particular type of mathematical structure and a hidden subgroup is another structure inside it unknown to the codebreaker—in the factoring example, the product produces the group and the unknown factors produce the hidden subgroup. On hidden subgroup problems, quantum computers are predicted to get exponential speed-up. Factoring is faster than searching to begin with, so an ordinary computer could factor a number of size 2¹⁵³⁶⁰ in the time it takes to search 2²⁵⁶ keys. But a quantum computer could factor that same number in more like the time it takes to search 20,000 keys. That’s an enormous speed-up. It would pretty much destroy RSA, and the situation is similar with all of the other public-key systems currently in common use."

http://nautil.us/blog/-how-classical-cryptography-will-survive-quantum-computers

 

(Some researchers claim that RSA, if used in a special way, would be quantum resistant.)

 

Therefore, researchers are now looking for quantum resistant algorithms, and even NIST has joined these efforts by running a competition for standardization.

Today, however, there is no well researched quantum secure algorithm ready for general use yet.

[Keksjdjdke 35]

 

Respectfully, quantum computing does not exist. All claims of quantum computing have proven false. And even if they did exist, they could at worst reduce the amount of work to half the amount currently required. And if every computer ever made worded together for a billion years, the odds are they could not break one single 256 bit key.

 

So to hell with the FUD. (Fear, Uncertainty, and Doubt.) Encryption is only weak if you rely on antiquated methods.

 

It seems that this is not completely correct. (I am not an expert for cryptography but just depict what I read in reputable sources.)

 

Apparently, there have been considerable advances with quantum computers in recent years, and many experts now seem to believe that large effective QCs will be there in the forseebale future:

 

https://www.itworldcanada.com/article/encryption-breaking-quantum-computers-getting-closer-warns-canadian-expert/396496

 

Further, while symmetric ciphers with long keys (like AES-256) will still be quite safe, the public-key cryptography we're using today (e.g. RSA and elliptic curves for key negotiation) will be broken with a large-scale quantum computer:

 

"For example, the Advanced Encryption Standard, approved by the United States government, has up to 2²⁵⁶—or about a 1 followed by 77 zeros—keys. A quantum computer could make that same search as if there were only 2¹²⁸ keys—about a 3 followed by 38 zeros. On the one hand, that’s a lot faster. On the other hand, it’s still an awful lot of searching to do.

...

Unfortunately for RSA, not all one-way functions are created equal. The factoring problem falls into a category known as “hidden subgroup problems.” A group is a particular type of mathematical structure and a hidden subgroup is another structure inside it unknown to the codebreaker—in the factoring example, the product produces the group and the unknown factors produce the hidden subgroup. On hidden subgroup problems, quantum computers are predicted to get exponential speed-up. Factoring is faster than searching to begin with, so an ordinary computer could factor a number of size 2¹⁵³⁶⁰ in the time it takes to search 2²⁵⁶ keys. But a quantum computer could factor that same number in more like the time it takes to search 20,000 keys. That’s an enormous speed-up. It would pretty much destroy RSA, and the situation is similar with all of the other public-key systems currently in common use."

http://nautil.us/blog/-how-classical-cryptography-will-survive-quantum-computers

 

(Some researchers claim that RSA, if used in a special way, would be quantum resistant.)

 

Therefore, researchers are now looking for quantum resistant algorithms, and even NIST has joined these efforts by running a competition for standardization.

Today, however, there is no well researched quantum secure algorithm ready for general use yet.

TorProject is working on implementing Post quantum encryption. Here is the Trac ticking tracking the implementation of PQ.

https://trac.torproject.org/projects/tor/ticket/24985

 

 

Preserve circuit-layer confidentiality against a quantum-capable adversary