Brute Force the Log

Try Powers

Each row tries one exponent and compares the power with the target.

highlighted = computed this step

Try one exponent per row

Each row computes g to x modulo p, then compares the result with y.

gx mod pg^x\bmod p
Try powers in orderThe tiny discrete-log rows are recomputed from p, g, and the target public value.Try powers in order - recovered=6quantityvaluek=15k=22k=310k=44k=520k=6 recovered8

The first row misses

At x=1, the value is 5, not the target 8.

51 mod 23=55^1\bmod{}23=5
Try powers in orderThe tiny discrete-log rows are recomputed from p, g, and the target public value.Try powers in order - recovered=6quantityvaluek=15k=22k=310k=44k=520k=6 recovered8

The next row also misses

At x=2, the value is 2. The search continues.

52 mod 23=25^2\bmod{}23=2
Try powers in orderThe tiny discrete-log rows are recomputed from p, g, and the target public value.Try powers in order - recovered=6quantityvaluek=15k=22k=310k=44k=520k=6 recovered8

Summary

A miss row is still useful: it rules out that exponent and moves to the next one.

rows tried so far=2\text{rows tried so far}=2
Try powers in orderThe tiny discrete-log rows are recomputed from p, g, and the target public value.Try powers in order - recovered=6quantityvaluek=15k=22k=310k=44k=520k=6 recovered8