Prime factorisation is indeed nobody’s primary idea of what a quantum computer will be useful for in practice any time soon, but it cannot be denied that Shor’s algorithm is the first and only method of prime factorisation we have discovered which can finish in realistic time with realistic resources.
And that means that RSA is no longer as safe as it once was, justifying the process of finding alternatives.
I love these slides about how quantum cryptography attacks are a made up scenario https://www.cs.auckland.ac.nz/~pgut001/pubs/bollocks.pdf
Dude is a comedic genius
Prime factorisation is indeed nobody’s primary idea of what a quantum computer will be useful for in practice any time soon, but it cannot be denied that Shor’s algorithm is the first and only method of prime factorisation we have discovered which can finish in realistic time with realistic resources.
And that means that RSA is no longer as safe as it once was, justifying the process of finding alternatives.
I’m sorry - did you read the slides?
Indeed I did. They seem to be pointing to the fact that current machines are not factoring primes in any serious way.
Does this contradict my point?