minus-squarevalgarf@discuss.tchncs.detoTechnology@beehaw.org•'It's going to be really bad': Fears over AI bubble bursting grow in Silicon Valleylinkfedilinkarrow-up8·15 days agoThe 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 linkfedilink
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