# kaal:claim:4900878-003

**Claim.** Current cryptographic systems such as RSA rest on the classical difficulty of factoring large primes, so quantum algorithms like Shor's algorithm, which factor exponentially faster, can render those cryptographic methods obsolete.

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

**Holds when.**

- applies to factoring based cryptography such as RSA
- requires sufficiently capable quantum hardware

**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 Tokenomics* (2024), 2.1 Quantum Computing and Quantum Economics, page 7

**Cite as.** Wulf A. Kaal, Quantum Economy and Tokenomics (2024). SSRN: https://ssrn.com/abstract=4900878

**Verify.** sha256 of source PDF `75bf96d3b751b4ad0a6ca4a32591cf026094f113e3a372aa6c61790941b391f7` at https://raw.githubusercontent.com/wulfkaal/Academic-Papers/main/papers/pdf/Kaal%20-%202024%20-%20Quantum%20Economy%20and%20Tokenomics.pdf

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

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

**Keywords.** cryptography, quantum-computing, rsa, security, quantum-resistance

**Related claims.**

- restated_by: https://wulfkaal.github.io/claims/4900880-005

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