Finished OMDL proof in GGM

thesis/sections/mu_security_of_eddsa/omdl'_implies_mu-gamez.tex

@@ -5,12 +5,13 @@ This section shows that \somdl implies MU-\igame using the Algebraic Group Model
 \paragraph{\underline{Introducing \somdl}} Similar to \sdlog being a variant of the discrete logarithm problem the \somdl is a variant of the one-more discrete logarithm problem which represents the special distribution of secret keys resulting from the key generation algorithm of the EdDSA signature scheme. The only difference to the original one-more discrete logarithm game as introduced in \cite{JC:BNPS03} is that the secret scalars are chosen from the set $\{2^{n-1}, 2^{n-1} + 8, ..., 2^{n} - 8\}$ which represents all valid secret scalars regarding the key generation algorithm. A lower bound on the hardness of the \somdl problem is further analyzed in section \ref{sec:somdl}. The \somdl game is depicted in figure \ref{fig:somdl}.
 
 \begin{definition}[\somdl]
+	\label{def:somdl}
 	Let $n$ and $N$ be positive integer. For an adversary $\adversary{A}$ we define its advantage in the \somdl game as following:
 	
 	\[ \advantage{\adversary{A}}{\text{\somdl}}(\secparamter) \assign | \Pr[\text{\somdl}^{\adversary{A}} \Rightarrow 1] |. \]
 \end{definition}
 
-\begin{figure}
+\begin{figure}[h]
 	\hrule
 	\vspace{1mm}
 	\large
@@ -47,8 +48,7 @@ This section shows that \somdl implies MU-\igame using the Algebraic Group Model
 
 \paragraph{\underline{Formal Proof}}
 
-% TODO: clarify encoding of c
-\begin{figure}
+\begin{figure}[h]
 	\hrule
 	\large
 	\vspace{1mm}
@@ -101,7 +101,7 @@ This section shows that \somdl implies MU-\igame using the Algebraic Group Model
 		\Pr[G_2^{\adversary{A}} \Rightarrow 1] = \advantage{\group{G},\adversary{B}}{\somdl}(\secparamter). \label{eq:adv_omdl'}
 	\end{align}
 	
-	\begin{figure}
+	\begin{figure}[h]
 		\hrule
 		\large
 		\vspace{1mm}