Will a quantum computer successfully use Shor’s algorithm to break a public-key cryptosystem, e.g. RSA, by 2030?
One-OffCriptoTecnología4aManifold MarketsSin KYCDatos de resolución verificadosBien calibradoPronóstico comunitario actualNo 85.3%
Pronosticadores
11
Tipo de pregunta
binary
Metodología
Play-money forecasting platform
Tipo de fuente
Pronóstico
Datos de mercado
Actualizado hace 10 horas
Desactualizado28 mar 23, 19:22 UTC1 ene 31, 0:01 UTC
Tendencias
Reglas
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.
