Diffie-Hellman

Shared Secret Match

Show both sides compute the same toy shared secret. This is toy arithmetic only, not deployable security.

Example

Show both sides compute the same toy shared secret.

highlighted = computed this step

Step 1 — Alice secret

Compute the highlighted cryptography value.

B power a mod p2\begin{array}{c|c}\text{B power a mod p}&\hlmath{\text{2}}\end{array}

Step 2 — Bob secret

Compute the highlighted cryptography value.

A power b mod p2\begin{array}{c|c}\text{A power b mod p}&\hlmath{\text{2}}\end{array}

Step 3 — Verdict

Compute the highlighted cryptography value.

verdictmatch\begin{array}{c|c}\text{verdict}&\hlmath{\text{match}}\end{array}
cryptography The values in this lesson are deliberately tiny so every modular arithmetic step can be checked exactly.