Example
State the boundary between toy arithmetic and real protocols.
highlighted = computed this step
Step 1 — Raw RSA
Compute the highlighted cryptography value.
raw RSAmalleable toy arithmetic
Step 2 — Missing pieces
Compute the highlighted cryptography value.
missinghash, padding, protocol checks
Step 3 — Verdict
Compute the highlighted cryptography value.
verdictnot deployable
cryptography
The values in this lesson are deliberately tiny so every modular arithmetic step can be checked exactly.