About this HTML presentation
This Shipslides page presents Mathematical Cryptography as an interactive HTML presentation deck in the Mathematics catalog with 13 slides. The share page keeps the uploaded deck sandboxed while exposing readable context, topics, and a slide outline for viewers and search engines.
A substitution cipher maps each plaintext letter to a fixed ciphertext letter. Caesar's shift is a special case: c ≡ p + k (mod 26) . Key sections include: MATHEMATICAL CRYPTOGRAPHY; Substitution & the Statistics That Betray It; The One-Time Pad — Unbreakable, Unusable; Modular Arithmetic — Integers, Wrapped; Fermat & Euler — Why RSA Works; RSA (1977) — Factoring as a Trapdoor; Diffie–Hellman — A Secret in Public; Elliptic Curves — Same Idea, Smaller Keys; One-Way: SHA-256 and the Compression Trick; Signing — Authorship Without Disclosure.
Key sections
- 01MATHEMATICAL CRYPTOGRAPHY
- 02Substitution & the Statistics That Betray It
- 03The One-Time Pad — Unbreakable, Unusable
- 04Modular Arithmetic — Integers, Wrapped
- 05Fermat & Euler — Why RSA Works
- 06RSA (1977) — Factoring as a Trapdoor
- 07Diffie–Hellman — A Secret in Public
- 08Elliptic Curves — Same Idea, Smaller Keys
