@along_the_road@beehaw.org to Technology@beehaw.org • edit-219 hours ago'It's going to be really bad': Fears over AI bubble bursting grow in Silicon Valleywww.bbc.comexternal-linkmessage-square51fedilinkarrow-up1185arrow-down11
arrow-up1184arrow-down1external-link'It's going to be really bad': Fears over AI bubble bursting grow in Silicon Valleywww.bbc.com@along_the_road@beehaw.org to Technology@beehaw.org • edit-219 hours agomessage-square51fedilink
minus-square@valgarf@discuss.tchncs.delinkfedilink4•9 hours 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
minus-square@frank@sopuli.xyzlinkfedilink2•9 hours agoThat’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
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