Will a quantum computer successfully use Shor’s algorithm to break a public-key cryptosystem, e.g. RSA, by 2030?
10
210Ṁ3922031
14%
chance
1D
1W
1M
ALL
In 1994 Peter Shor developed a quantum algorithm for finding the prime factors of an integer; on a quantum computer it runs in polylogarithmic time, which is almost an exponential speed-up over the fastest classical algorithms.
Major cryptosystems rely on the relative difficulty of factoring the product of two large primes. Large quantum computers could utilise the algorithm to pose a major threat to these systems.
This market will resolve YES if any major cryptosystem is broken using a quantum computer running Shor's algorithm by 2030; else, it will resolve NO.
This question is managed and resolved by Manifold.
Get
1,000 to start trading!
1,000Related questions
Related questions
When will Quantum computing become viable?
2029
Will Quantum computing break RSA encryption before 2030?
38% chance
Will a quantum computer prove capable of breaking 2048 bit RSA encryption by 2030?
18% chance
Will a quantum computer factor the RSA-2048 challenge number before 2030?
8% chance
Will a quantum computer factor the RSA-2048 challenge number before 2035?
47% chance
Will a quantum computer factor the RSA-2048 challenge number before 2050?
81% chance
Will a quantum computer factor the RSA-2048 challenge number before 2075?
78% chance
Will a quantum computer show a clear advantage vs classical computers in solving a major cryptographic problem by 2030?
40% chance
Will a quantum computer factor the RSA-2048 challenge number before 2040?
65% chance
Will a quantum computer factor the RSA-2048 challenge number before 2100?
88% chance