update

crypto.tex

@@ -214,7 +214,7 @@ The algorithm they came up with relies on modular arithmetic, which remains the
 
 \begin{enumerate}
     \item Choose randomly and stochastically independet primes $p,q$ of similar size so that
-        $0.1 < | \log_2 p - \log_2 q | < 30 $.
+        \newline$0.1 < | \log_2 p - \log_2 q | < 30 $.
     \item Calculate $ N= p \cdot q $
     \item Compute Euler's totient function of $ \varphi (N) = (p-1) \cdot (q-1)$ which is kept secret.
     \item Choose an integer $e$ so that $ 1 < e < \varphi (N) $ and $\gcd(e, \varphi(N)) =1$, i.e. $e$ and $\varphi(N)$
@@ -227,7 +227,14 @@ The algorithm they came up with relies on modular arithmetic, which remains the
 Trust on the web with untrusted channels fundamentally remains an unsolved issue,
 though depending on the threat model, everyday communications can be considered relatively secure from non-APT actors.
 A typical cipher suite employed by TLS could look like the following:
-$$\ub{ECDHE}{Key exchange}-\ub{ECDSA}{authentication}-\ub{AES128}{encryption}-\ub{GCM}{Galois/counter mode}-\ub{SHA256}{hashing} $$
+$$\ub{ECDHE}{Key exchange}-\ub{ECDSA}{authentication}-\ub{AES128}{encryption}-\ub{GCM}{Cipher operation mode}-\ub{SHA256}{hashing} $$
+\begin{itemize}
+    \item \textbf{ECDHE} Elliptic Curve Diffie Hellman Exchange
+    \item \textbf{ECDSA} Elliptic Curve Digital Signing Algorithm
+    \item \textbf{AES128} 128-Bit \acrfull{AES} symmetric encryption
+    \item \textbf{GCM} Galois Counter Mode
+    \item \textbf{SHA256} Secure Hash Algorithm
+\end{itemize}
 \cite{enwiki:ciphersuite,enwiki:galoismode}
 %\printglossary[type=\acronymtype]
 %\printglossary