deletions | additions       diff --git a/untitled.tex b/untitled.tex  index 88a49e4..4e16c39 100644  --- a/untitled.tex  +++ b/untitled.tex 
...
\section{Working with exponents in nonpower-of-2 bases}  The other advantage that we discard if we work in an odd base is the fact that have to do something to convert our multiplier (which is in binary) into the base. The obvious approach would be to compute $k + rn$ in binary, and then do a base conversion into our desired format. The problem with that is that the digits of $k + rn$ will be expressed as a temporary, and thus will be subject to the same side channel attacks that we are trying to avoid.  However, there are ways to avoid this issue; we will review twopossibilities (which are applicable to  different protocols. protocols, and give a possibility of how this can be addressed in both of them.  \section{The \subsection{The  case of ECDH/ECIES} The easiest case to handle is the case of ECDH/ECIES. In these cases, the integer that we multiply by is just a random number that we pick, and has no correlation with any other value (with the exception that we multiply two different points by the same integer).  \begin{itemize}  \item ECDH/ECIES  \item ECDSA  \item Performance estimates  \end{itemize} 
...