Finds the largest exponent e with bᵉ ≡ t (mod p). Counters show (1) total elementary steps, (2) fast‑exponentiation loop iterations (“doublings”), and (3) every modular multiplication performed.
e
bᵉ ≡ t (mod p)