Quote from: ranochigo on January 12, 2021, 02:14:40 PM

Yes and no. Quantum computing is very useful for integer factorization with Shor's algorithm and offers an advantage for asymmetric algorithms to be cracked. This means that any pre-existing technology that uses public key cryptography, such as RSA and ECDSA are susceptible to such attacks. Is it more profitable for governments (presumably because they will have the budget required to operate one) to break TLS encryption or Bitcoin public keys? As of now, we're still quite a few years away from quantum computers with sufficient qubit to be able to crack asymmetric algorithms.

On the other hand, Grover's algorithm offers a quadratic speed up for symmetric algorithms. If your encryption cipher has a large enough key size, you're safe.

The problem is they are going to break it down, I'm sure you understand this - but others might not. The real question is whether they are going to be able to use partial searches/partitions in order to run the algo faster. If they can create the correct local iteration in order to speed up the process, it might work. The next part of the problem is whether to grid up the local partitions in order to create a more complex algo that cane be increased by "n" speed as it is increased by 1 partition. Who knows, haven't researched it in a while.