Add some answers
This commit is contained in:
parent
6da3e784cd
commit
bbb26ba291
1 changed files with 15 additions and 3 deletions
|
@ -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) \\
|
||||
|
|
Reference in a new issue