diff --git a/thesis/Abschlussarbeit.tex b/thesis/Abschlussarbeit.tex
index 5e4c21e..2b24e30 100644
--- a/thesis/Abschlussarbeit.tex
+++ b/thesis/Abschlussarbeit.tex
@@ -20,6 +20,7 @@ listof=totoc,
 \usepackage[,hhmmss]{datetime}
 
 \newtheorem{theorem}{Theorem}
+\newtheorem{definition}{Definition}[section]
 
 \begin{document}
 \include{macros.tex}
diff --git a/thesis/sections/security_of_eddsa/dlog'_implies_gamez.tex b/thesis/sections/security_of_eddsa/dlog'_implies_gamez.tex
index 0a60ce2..9b17db1 100644
--- a/thesis/sections/security_of_eddsa/dlog'_implies_gamez.tex
+++ b/thesis/sections/security_of_eddsa/dlog'_implies_gamez.tex
@@ -8,11 +8,12 @@ This section shows that \sdlog implies \igame using the Algebraic Group Model. T
 
 The \sdlog game is a variant of the discrete logarithm game which represents the clearing and setting of bits in the secret scalar during the EdDSA key generation. The only difference to the normal discrete logarithm game is that the secret scalars are not choosen uniformly random from $\field{L}$ with $L$ being the order of the generator but rather from the set $\{2^{n-1}, 2^{n-1} + 8, ..., 2^{n} - 8\}$. This set represents all valid private keys according to the key generation algorithm. The hardness of this version of the discrete logarithm problem is further analyzed in section \ref{sec:sdlog}. The \sdlog game is depicted in figure \ref{fig:sdlog}. 
 
-For an adversary $\adversary{A}$ we define its advantage in the \sdlog game as following:
+\begin{definition}[\sdlog]
+	For an adversary $\adversary{A}$ we define its advantage in the \sdlog game as following:
+	
+	\[ \advantage{\adversary{A}}{\sdlog}(k) \assign | \Pr[\sdlog \Rightarrow 1] | \]
+\end{definition}
 
-% TODO: \sdlog => \sdlog^{\adversary{A}}
-% TODO: Sicherheitsparameter von dlog'?
-\[ \advantage{\adversary{A}}{\sdlog}(k) \assign | \Pr[\sdlog \Rightarrow 1] | \]
 
 \begin{figure}
 	\hrule