Symmetric and Hashing

Hash Sensitivity

Change one toy message nibble and recompute the final hash. This is toy arithmetic only, not deployable security.

Example

Change one toy message nibble and recompute the final hash.

highlighted = computed this step

Step 1 — Original hash

Compute the highlighted cryptography value.

original message, hash((7, 5, 4), 0)\begin{array}{c|c}\text{original message, hash}&\hlmath{\text{((7, 5, 4), 0)}}\end{array}

Step 2 — Changed input

Compute the highlighted cryptography value.

changed message(7, 6, 4)\begin{array}{c|c}\text{changed message}&\hlmath{\text{(7, 6, 4)}}\end{array}

Step 3 — Recompute

Compute the highlighted cryptography value.

changed last row: byte, before, raw, hash(4, 7, 39, 5)\begin{array}{c|c}\text{changed last row: byte, before, raw, hash}&\hlmath{\text{(4, 7, 39, 5)}}\end{array}

Final Step — Verdict

Compute the highlighted cryptography value.

hash comparisonchanged\begin{array}{c|c}\text{hash comparison}&\hlmath{\text{changed}}\end{array}
cryptography This lesson shows a toy hash changing when the message changes, without claiming real collision resistance.