Lines Matching refs:modulo
1298 This reduces $a$ modulo $b$ and stores the result in $c$. The sign of $c$ shall agree with the sign
1319 This will reduce $a$ in place modulo $b$ with the precomputed $\mu$ value in $c$. $a$ must be in the range
1346 /* now reduce `c' modulo b */
1360 /* now reduce `c' modulo b */
1392 This reduces $a$ in place modulo $m$ with the pre--computed value $mp$. $a$ must be in the range
1515 This reduces $a$ in place modulo $b$ with the pre--computed value $mp$. $b$ must be of a restricted
1544 This will reduce $a$ in place modulo $n$ with the pre--computed value $d$. From my experience this routine is
1690 \hline LTM\_PRIME\_BBS & Make the prime congruent to $3$ modulo $4$ \\
1806 then the result will be $-1$ when $a$ is not a quadratic residue modulo $p$. The result will be $0$ if $a$ divides $p$
1807 and the result will be $1$ if $a$ is a quadratic residue modulo $p$.
1814 Computes the multiplicative inverse of $a$ modulo $b$ and stores the result in $c$ such that $ac \equiv 1 \mbox{ (mod }b\mbox{)}$.
