fix: links fixed

_posts/Lecture Notes/Internet Security/2023-10-04-rsa-elgamal.md

@@ -20,7 +20,7 @@ github_title: 2023-10-04-rsa-elgamal
 Suppose we are given integers $a$ and $N$. For any integer $x$ that is relatively prime to $N$, we choose $b$ so that
 
 $$
- 
+
 \tag{$*$}
 ab \equiv 1 \pmod{\phi(N)}.
 $$
@@ -139,7 +139,7 @@ This is an inverse problem of exponentiation. The inverse of exponentials is log
 
 Given $y \equiv g^x \pmod p$ for some prime $p$, we want to find $x = \log_g y$. We set $g$ to be a generator of the group $\mathbb{Z}_p$ or $\mathbb{Z}_p^*$, since if $g$ is the generator, a solution always exists.
 
-Read more in [discrete logarithm problem (Modern Cryptography)](2023-10-03-key-exchange.md#discrete-logarithm-problem-dl).
+Read more in [discrete logarithm problem (Modern Cryptography)](../../modern-cryptography/2023-10-03-key-exchange#discrete-logarithm-problem-dl).
 
 ## ElGamal Encryption