I've been working on this problem for a while now. Could someone please help me see where I'm going wrong? "Alice and Bob agree to use a Difﬁe-Hellman key exchange with values p = 431 and primitive ...
If $p$ is a prime and $a,b$ are integers not divisible by $p$ such that $a^x \equiv b \pmod p$ with $0 ≤ x < o_p(a)$, then we define $x = L_a(b)$ and say $x$ is the discrete logarithm of $b$ ...
What are examples of groups, where DLP (discrete logarithm problem) is hard? Two obvious ones are: integers modulo $p$ ($p$ being prime) and elliptic curves over finite fields. What are the others?