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} (mod p) $$
What are the solutions for discrete integers b, d to a^b≡c^d (mod p) where p is a large prime number?
riseup
- 13
- 2