fix typos

Author: qslg154

content/posts/puctf25.md

@@ -103,7 +103,7 @@ print(long_to_bytes(power_mod(c, d, N)))
 ## Simple AES
 As source code is not provided, we need to first make an educated guess of what the functions in the remote instance correspond to. We can carry out two types of operation in the remote instance, so let's see some example inputs
 
-```
+```txt
 ======================
       Simple AES
 ======================
@@ -245,7 +245,7 @@ $$ x \equiv z^{y - Ne} \mod{N} $$
 does not seem possible, even though we can pick $x = z^{k}$ for some $k$, we 
 cannot have $y = Ne + k$ directly due to the boundary condition. This degenerates into a DLP or factorization:
 
-- solving $x = z^{c}$ for $c \in \{y - Ne|0\leq y < 2^{1020}\}$
+- solving $x = z^{c} \text{ for } c \in \{y - Ne \mid 0 \leq y < 2^{1020}\}}$
 - or finding $\phi(N)$ so we can put $x = 1, y = \phi e - Ne$ 
 
 which is infeasible, thus, we need extra information to convince the verifier.