The same modular exponentiation shape appears in RSA and Diffie-Hellman. This book keeps the claim to exact arithmetic over toy inputs.
highlighted = computed this step
Why this shows up again
RSA and Diffie-Hellman reuse this arithmetic shape with different pinned inputs.
bemodm
Name the reusable shape
The shape is base 7 to exponent 13 modulo 33, evaluated by the same square-and-multiply rows.
713mod33
What changes later
Later books change the base, exponent, or modulus. The trust boundary still recomputes the same kind of ladder before displaying a result.
new inputs, same recompute
Toy numbers only
The modulus 33 is small so the arithmetic can be inspected. NOTE: toy-modulus; no-production; never-roll-your-own. This is not a secure modulus.
m=33
What this model excludes
NOTE: no-padding; no-side-channel; no-production; never-roll-your-own. This lesson models exact arithmetic only; padding, timing, side channels, and key security are outside this static table.