kaal:claim:4900878-003

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.

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 Tokenomics (2024), 2.1 Quantum Computing and Quantum Economics, p. 7
https://ssrn.com/abstract=4900878 · source PDF

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

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

failuresupport: arguedfailure: classical-cryptography-obsolescencefamily: consensus-and-protocol-attackconsensus-and-securitycitation-and-knowledge

• restated_by kaal:claim:4900880-005 Quantum algorithms such as Shor's algorithm can factor large prime numbers exponentially faster than classical...

The quote above is an exact substring of the source PDF, whose sha256 is 75bf96d3b751b4ad0a6ca4a32591cf026094f113e3a372aa6c61790941b391f7. Extraction method: pdf-text-layer.
Attestation record: colloquium/attestations/eb0af2683aa89bfa...json
Verify the binding yourself: curl -s https://wulfkaal.github.io/claims/4900878-003.md | sha256sum