That’s how it’s been explained to me by laymen many many times. Just casually (ish, I have a math degree) looking at the math, chatting with a friend who is a quantum physicist, being involved with computers, etc I find that Grover’s Algorithm is not at all capable of something like that. I’m not sure there’s anything better in terms of breaking encryption
Grover’s algorithm could brute-force a 128-bit symmetric cryptographic key in roughly 264 iterations, or a 256-bit key in roughly 2128 iterations. It may not be the case that Grover’s algorithm poses a significantly increased risk to encryption over existing classical algorithms, however.[4]
I am stoked for what it could do for protein folding, or other heavy simulation work, but in terms of proper encryption I don’t believe it actually will change much.
That’s fair, Shor’s algorithm would probably break a bunch of older encryption. It’s a little further out of reach, in terms of feasibility but who knows how fast it could speed up
That’s how it’s been explained to me by laymen many many times. Just casually (ish, I have a math degree) looking at the math, chatting with a friend who is a quantum physicist, being involved with computers, etc I find that Grover’s Algorithm is not at all capable of something like that. I’m not sure there’s anything better in terms of breaking encryption
https://en.wikipedia.org/wiki/Grover's_algorithm
I am stoked for what it could do for protein folding, or other heavy simulation work, but in terms of proper encryption I don’t believe it actually will change much.
The typical example is Shor’s algorithm
https://en.wikipedia.org/wiki/Shor's_algorithm
It allows to efficiently find the prime factors of an integer - a problem without a known polynomial algorithm on a classical computer.
This would directly break RSA encryption, as it relies on factorisation being difficult.
https://en.wikipedia.org/wiki/RSA_cryptosystem
However, there are encryption algorithms that are considered safe even against a quantum computer.
https://en.wikipedia.org/wiki/Post-quantum_cryptography
That’s fair, Shor’s algorithm would probably break a bunch of older encryption. It’s a little further out of reach, in terms of feasibility but who knows how fast it could speed up