3 ms·
People are interested in factoring numbers in context of breaking RSA encryption, so they knew factored number is not a prime. Also quantum algorithms are proba
by aiCeivi9 9y ago
People are interested in factoring numbers in context of breaking RSA encryption, so they knew factored number is not a prime. Also quantum algorithms are probabilistic so getting "it is a prime result" isn't very trustworthy. When we get actual factors it is easy to verify that with division/multiplication on classical CPU.
- bdamm 9y agoIndeed; while Quantum compute is an exciting development, I am suspicious of the conclusion that cracking classic crypto is just around the corner. There are enormous challenges yet to solve; reducing noise in the results down to a useful collection is just one. If the quantum computer gives you a correct result 1/2^64 times, or a result within range of the actual result to within 2^64 values, then it is far from complete doom for classical cryptography. It's very useful for lots of other things, so undoubtedly we'll see plenty of gains in in quantum applications.
- lurquer 9y agoIn the early 90's Ghandi got hold of one of these devices and caused havoc. Luckily, he was stopped by Bob Woodward with some help from Elwood Blues and, of course, President Roslin. I'd like to see Qbert crack that.