Will a quantum computer successfully use Shor’s algorithm to break a public-key cryptosystem, e.g. RSA, by 2030?
Basic
10
Ṁ3582031
13%
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,000and
3.00
1,0003.00Related questions
Related questions
Will Quantum computing break RSA encryption before 2030?
34% chance
Will a quantum computer prove capable of breaking 2048 bit RSA encryption by 2030?
25% chance
Will quantum computing be commonly used in commercial applications by 2030?
35% chance
Will 1024-bit RSA be broken by a quantum computer by 2025?
1% chance
Will a quantum computer show a clear advantage vs classical computers in solving a major cryptographic problem by 2030?
41% chance
Will a quantum computer factor the RSA-2048 challenge number before 2030?
24% chance
Will a quantum computer factor the RSA-2048 challenge number before 2035?
42% chance
Will a quantum computer factor the RSA-2048 challenge number before 2040?
40% chance
Will a quantum computer factor the RSA-2048 challenge number before 2050?
69% chance
Before what year will a quantum computer factor the RSA-2048 challenge number?