%-*- root: paper.tex -*-

\section{Experimental results and possible variants}

The analysis of the algorithm presented in the previous section shows that
our proposed algorithm has better asymptotic complexity than the original recovering
algorithm. We now show our results for the performance of the algorithm in practice,
and also propose some improvements for different amounts of available information
about the spectra. We implemented our proposed reconstruction algorithm in C using the Pari~\cite{PARI2} library for the kernel matrix computation.


\subsection{Proposed algorithm}



\begin{figure}[!h]
  \centering
  \includegraphics[scale=1]{figures/expresults/performance_80sec_no_s1.pdf}
  \caption{Legenda}
  \label{figRotulo}
\end{figure}

\subsection{Improving performance by using less information}

We can improve the performance of the algorithm when $|Z_0|$

\begin{figure}[!h]
  \centering
  \includegraphics[scale=1]{figures/ourattack/attacks_with_12_and_22_fixed_ones.pdf}
  \caption{Legenda}
  \label{figRotulo}
\end{figure}


\subsection{Fixing more than two ones for extreme cases}


\subsection{The number of challenges needed for a CCA2 attack}



