Let’s solve the discrete log problem by the Baby Step-Giant Step method of Subsection 10.2.2. We take since and we form two lists. The first is for
>for j from 0 while j <= 11 do; (j, 2&ĵ mod 131); end do;
0, 1
1, 2
2, 4
3, 8
4, 16
5, 32
6, 64
7, 128
8, 125
9, 119
10, 107
11, 83
The second is for
> for j from 0 while j <= 11 do; (j, 71*2&^: (-12*j) mod 131); end do;
0, 71
1, 17
2, 124
3, 26
4, 128
5, 86
6, 111
7, 93
8, 85
9, 96
10, 130
11, 116
The number 128 is on both lists, so we see that Therefore,