Add Stern part

sec-lattices.tex

@@ -54,7 +54,8 @@ For any lattice~$\Lambda \subseteq \RR^{n}_{}$ and positive real number~$\sigma>
 $\Pr_{\mathbf{b} \sample D_{\Lambda,\sigma}} \left[ \|\mathbf{b}\| \leq \sigma \sqrt{n} \right] \geq 1-2^{-\Omega(n)}.$
 \end{lemma}
 
-In order to work with lattices in cryptography, hard lattice problems have to be defined. In the following we state the \textit{Shortest Independent Vectors Problem}~($\SIVP$).
+In order to work with lattices in cryptography, hard lattice problems have to be defined~\cite{Ajt96}.
+In the following we state the \textit{Shortest Independent Vectors Problem}~($\SIVP$).
 This problem reduces to the \textit{Learning With Errors}~($\LWE$) problems and the Short Integer Solution~($\SIS$) problem as explained later in \cref{le:sis-hard} and~\ref{le:lwe-hard}.
 These links are important as those are ``worst-case to average-case'' reductions.