Is there a way to efficiently discover or choose the integers $b$, $d$ for the congruence relationship below where $p$ is a large prime number? Is there a name for this relationship?


$$
a^{b} = c^{d} \ (\text{mod} \ p)
$$