# kaal:claim:4900880-005

**Claim.** 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.

**Type.** failure  **Support.** argued

**Holds when.**

- assumes cryptographically relevant quantum computers become available

**Source quote.**

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

**From.** Wulf A. Kaal, *Quantum Economy and the Future of Work* (2024), 2.1 Quantum Computing and Quantum Economics, page 8

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

**Verify.** sha256 of source PDF `64ea6e8b7cfb3d9a83801eba54f9b87182b842a963273ddab7f2d5305639db73` at https://raw.githubusercontent.com/wulfkaal/Academic-Papers/main/papers/pdf/Kaal%20-%202024%20-%20Quantum%20Economy%20and%20the%20Future%20of%20Work.pdf

**Failure mode.** cryptographic-obsolescence  (family: consensus-and-protocol-attack)

**Topics.** consensus-and-security, citation-and-knowledge

**Keywords.** cryptography, shors-algorithm, rsa, quantum-computing, security

**Related claims.**

- restates: https://wulfkaal.github.io/claims/4900878-003
- supports: https://wulfkaal.github.io/claims/4900878-034

**Canonical form.** This markdown file is the canonical hashed representation of the claim. Its sha256 is the content hash used for attestation.