vOne of the one$-$way functions used in public key cryptography is the discrete logarithm. Computing $$mod$$

from $,,$

and $$

is easy. But given only $$

$,$

and $$

$,$ recovering $$

is hard.

Suppose $=1453$

$,=8$

and $=1212$

$.$

What is the smallest positive integer $$

such that $$mod$$

$?$v