Will a quantum computer successfully use Shor’s algorithm to break a public-key cryptosystem, e.g. RSA, by 2030?
One-OffCriptoTecnologia4aManifold MarketsSem KYCDados de resolução verificadosRazoavelmente calibradoPrevisão da comunidade atualNão 85.3%
Previsores
11
Tipo de pergunta
binary
Metodologia
Play-money forecasting platform
Tipo de fonte
Previsão
Dados do mercado
Atualizado há 1 hora
Atrasado28/03/23, 19:22 UTC1/01/31, 00:01 UTC
Tendências
Regras
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.
