kaal:claim:4900880-005

Quantum algorithms such as Shor's algorithm can factor large prime numbers exponentially faster than classical computers, which potentially renders currently deployed cryptographic systems including RSA obsolete.

Quantum algorithms, such as Shor's algorithm, can factor these numbers exponentially faster, potentially rendering existing cryptographic methods obsolete.

Wulf A. Kaal, Quantum Economy and the Future of Work (2024), 2.1 Quantum Computing and Quantum Economics, p. 8
https://ssrn.com/abstract=4900880 · source PDF

Wulf A. Kaal, Quantum Economy and the Future of Work (2024). SSRN: https://ssrn.com/abstract=4900880

• assumes cryptographically relevant quantum computers become available

failuresupport: arguedfailure: cryptographic-obsolescencefamily: consensus-and-protocol-attackconsensus-and-securitycitation-and-knowledge

• restates kaal:claim:4900878-003 Current cryptographic systems such as RSA rest on the classical difficulty of factoring large primes, so quant...
• supports kaal:claim:4900878-034 Quantum computing cuts both ways for blockchain: it can raise the efficiency and security of blockchain networ...

The quote above is an exact substring of the source PDF, whose sha256 is 64ea6e8b7cfb3d9a83801eba54f9b87182b842a963273ddab7f2d5305639db73. Extraction method: pdf-text-layer.
Attestation record: colloquium/attestations/145c3d4a41c61ff2...json
Verify the binding yourself: curl -s https://wulfkaal.github.io/claims/4900880-005.md | sha256sum