Also the largest number ever factorized on a quantum computer (not simulated) is like 30. So this is like 1950’s level of computing(in terms of number of transistors vs qbits) and we’re 20-30 years of incremental change away from really threatening encryption
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
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
Also the largest number ever factorized on a quantum computer (not simulated) is like 30. So this is like 1950’s level of computing(in terms of number of transistors vs qbits) and we’re 20-30 years of incremental change away from really threatening encryption
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
So basically anything not using RSA is fine, which is probably everything these days.