From bbb26ba29152e2dff2aa005f94af42276ef1df2b Mon Sep 17 00:00:00 2001 From: Florian Hoss Date: Fri, 10 Jun 2022 11:53:48 +0200 Subject: [PATCH] Add some answers --- Lab04/documentation/part5/part5.tex | 18 +++++++++++++++--- 1 file changed, 15 insertions(+), 3 deletions(-) diff --git a/Lab04/documentation/part5/part5.tex b/Lab04/documentation/part5/part5.tex index 08d70cc..05dc452 100644 --- a/Lab04/documentation/part5/part5.tex +++ b/Lab04/documentation/part5/part5.tex @@ -29,19 +29,31 @@ g = 9, x = 2, y = 3, n = 227 (prime3) k = k_{1} = k_{2} = 34\ (private) \end{align} +\newpage + \subsection{Fragen und Antworten} 1. What attack is the Diffie-Hellman key exchange vulnerable to? -- Man in the Middle +\begin{list}{-}{} + \item Man in the Middle +\end{list} 2. What measures can be taken to prevent this type of attack? -- Encryption, Authentication over QR code or 2Factor-Authentication +\begin{list}{-}{} + \item Encrypting exchange (VPN) + \item Signature verification + \item Combine with RSA/AES + \item Authentication at Server-Level over QR code or 2Factor-Authentication +\end{list} 3. For the Diffie-Hellman, a generator g is used. Explain what a generator is and how can it be found -- A generator is a number that will be the base of the calculation and is shared between the 2 parties. G is a small prime number. +\begin{list}{-}{} + \item A generator is a number that will be the base of the calculation and is shared between the 2 parties + \item G is a small prime number. +\end{list} \begin{align} g^{a}\ (mod\ n) \neq g^{b}\ (mod\ n) \\