Merge branch 'master' of gitea.sec.tu-bs.de:y0085044/Exercise-01

breakmono2
Eggert Jung 5 years ago
commit 11c538ff4a

Binary file not shown.

@ -50,9 +50,39 @@ line/.style={-latex} % the lesser the width the greater will be the diagram wi
\newpage
\section{Security goals}
\subsection*{a)}
Concerning her home, Alice might have the following security goals which Mallory violated by physically breaking in:
\begin{itemize}
\item \textbf{Confidentiality}: Mallory might have stolen \textit{private data}, like a love letter, which is now at risk of being disclosed.
\item \textbf{Integrity}: Mallory might have manipulated a number of things in Alice's home, like the router configuration or the fire alarm. Depending on Mallory's intentions all things (including \textit{private} and \textit{valuable} data) inside her home and Alice's life itself might be at risk.
\item \textbf{Availibility}: Some of Alice's things, like household appliances or jewelry, might be missing.
\end{itemize}
\subsection*{b)}
\begin{itemize}
\item Alice could have \textit{prevented} the breaking by having a stronger door, a better lock, or a guard outside her home. She also could have kept the location of her home private.
\item Alice could have had alarms inplace to \textit{detect} the break-in when it was happening and intervene.
\item Additionally, Alice might have have had security cameras which might have captured the break-in for later \textit{analysis} to prevent break-ins in the future.
\end{itemize}
\section{Simple combinatorics}
Let \( \mathbb{K} \) be the keyspace \textit{K} the key.
\subsection*{a) ROT13}
\texttt{ROT13} is the shift of an alphabet by 13 letters. Thereby it's a special case of the \textit{caesar} cipher (shift of an alphabet by \textit{k} letters). Thus 13 is the key and \( |\mathbb{K}| = 1 \).
\subsection*{b) Vigenère Cipher}
Let \textit{k} be the lenght of the chosen alphabet. Let \( |K| = n \). Thus \( \mathbb{K} = k^n \).
\subsection*{c) 256 bit AES}
\( \mathbb{K} = 2^{256} \).
\subsection*{d) monoalphabetic substitution cipher}
We assume that \textit{k} is the lenght of the alphabet. Thus \( \mathbb{K} = k! \).
\section{XOR cipher}
Following the rule $a \oplus b = c \Leftrightarrow b = a \oplus c$ these calculations can be made:

Loading…
Cancel
Save