AuroraMiddleware/libtommath
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

fix doc/bn.tex

Browse Source
This commit is contained in:
Steffen Jaeckel 2018-12-26 15:48:12 +01:00
parent e84c094864
commit cdfe484869
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
doc/bn.tex
View File

@ -1168,7 +1168,7 @@ It is also not very uncommon to need just the power of two $2^b$; for example t
\begin{alltt}
int mp_2expt(mp_int *a, int b);
\end{alltt}
It is faster than doing it by shifting $1$ with \texttt{mp_mul_2d}.
It is faster than doing it by shifting $1$ with \texttt{mp\_mul\_2d}.
\subsection{Polynomial Basis Operations}
@ -1745,7 +1745,7 @@ moduli of the a ``restricted diminished radix'' form lead to the fastest modular
and the other two algorithms.
\section{Modulus a Power of Two}
\index{mp\_mod_2d}
\index{mp\_mod\_2d}
\begin{alltt}
int mp_mod_2d(const mp_int *a, int b, mp_int *c)
\end{alltt}