Lines Matching refs:Where
163 However, there are cases where such a build is not optional. For instance, you want to perform RSA operations. You
252 function per source file and often I use a ``middle-road'' approach where I don't cut corners for an extra 2\% speed
284 So it may feel tempting to just rip the math code out of GnuPG (or GnuMP where it was taken from originally) in your
346 Where ``mp\_digit'' is a data type that represents individual digits of the integer. By default, an mp\_digit is the
548 When an mp\_int is in a state where it won't be changed again\footnote{A Diffie-Hellman modulus for instance.} excess
1100 Which compute $c = a \odot b$ where $\odot$ is one of OR, AND or XOR.
1112 Which perform $c = a \odot b$ where $\odot$ is one of signed addition or subtraction. The operations are fully sign
1251 Where ``XXX'' is one of the following entries from the table \ref{fig:tuning}.
1284 Of particular interest to cryptography are reductions where $b$ is limited to the range $0 \le b < c^2$ since particularly
1400 where $R = \beta^n$, $n$ is the n number of digits in $m$ and $\beta$ is radix used (default is $2^{28}$).
1497 form $\beta^k - p$ for some $k \ge 0$ and $0 < p < \beta$ where $\beta$ is the radix (default to $2^{28}$).
1520 BBS cryptographic purposes. This reduction algorithm is useful for Diffie-Hellman and ECC where fixed
1642 $1 \le t < PRIME\_SIZE$ where $PRIME\_SIZE$ is the number of primes in the prime number table (by default this is $256$).
