update typo and structures

pages/CSE442T/CSE442T_L17.md

@@ -1,6 +1,6 @@
 # Lecture 17
 
-## Strength through Truth
+## Chapter 3: Indistinguishability and Pseudorandomness
 
 ### Public key encryption scheme (1-bit)
 
@@ -90,7 +90,7 @@ $Dec_{sk}:r_k=f_i^{-1}(y_k),h_i(r_k)\oplus c_k=m_k$
 
 ### Special public key cryptosystem: El-Gamal (based on Diffie-Hellman Assumption)
 
-#### Definition: Decisional Diffie-Hellman Assumption (DDH)
+#### Definition 105.1 Decisional Diffie-Hellman Assumption (DDH)
 
 > Define the group of squares mod $p$ as follows:
 > 
@@ -104,7 +104,7 @@ $\{p\gets \tilde{\Pi_n};y\gets Gen_q;a,b\gets \mathbb{Z}_q:(p,y,y^a,y^b,y^{ab})\
 
 $\{p\gets \tilde{\Pi_n};y\gets Gen_q;a,b,\bold{z}\gets \mathbb{Z}_q:(p,y,y^a,y^b,y^\bold{z})\}_n$
 
-> Diffie-Hellman Assumption:
+> (Computational) Diffie-Hellman Assumption:
 >
 > Hard to compute $y^{ab}$ given $p,y,y^a,y^b$.