Lines Matching +refs:default +refs:value
120 and static then install (by default) into /usr/lib as well as install the header files in /usr/include. The shared
159 ``tommath\_superclass.h''. By default, the symbol ``LTM\_ALL'' shall be defined which simply
346 Where ``mp\_digit'' is a data type that represents individual digits of the integer. By default, an mp\_digit is the
385 represents the default integer which is zero. If the functions returns MP\_OKAY then the mp\_int is ready to be used
515 default number of digits. By default, all initializers allocate \textbf{MP\_PREC} digits. This function lets
596 contribute to the value of the mp\_int. The \textit{alloc} parameter dictates how many digits are currently available in
655 This will zero the contents of $a$ and make it represent an integer equal to the value of $b$. Note that this
691 This will assign the value of the 32-bit variable $b$ to the mp\_int $a$. Unlike mp\_set() this function will always
692 accept a 32-bit input regardless of the size of a single digit. However, since the value may span several digits
718 printf("Error setting the value of the number. \%s",
867 To compare two mp\_int variables based on their signed value the mp\_cmp() function is provided.
1050 This will multiply $a$ by $2^b$ and store the result in ``c''. If the value of $b$ is less than or equal to
1061 value to signal that the remainder is not desired.
1146 $bc + d = a$. Note that either of $c$ or $d$ can be set to \textbf{NULL} if their value is not required. If
1238 actually faster than Comba until you hit distinct ``cutoff'' points. For Karatsuba with the default configuration,
1304 a decent speedup over straight division. First a $\mu$ value must be precomputed with the following function.
1311 Given a modulus in $b$ this produces the required $\mu$ value in $a$. For any given modulus this only has to
1319 This will reduce $a$ in place modulo $b$ with the precomputed $\mu$ value in $c$. $a$ must be in the range
1332 /* get mu value */
1385 For the given odd moduli $a$ the precomputation value is placed in $mp$. The reduction is computed with the
1392 This reduces $a$ in place modulo $m$ with the pre--computed value $mp$. $a$ must be in the range
1395 Montgomery reduction is faster than Barrett reduction for moduli smaller than the ``comba'' limit. With the default
1400 where $R = \beta^n$, $n$ is the n number of digits in $m$ and $\beta$ is radix used (default is $2^{28}$).
1411 example, to calculate $a^3 \mbox { mod }b$ using Montgomery reduction the value of $a$ can be normalized by
1432 /* get mp value */
1497 form $\beta^k - p$ for some $k \ge 0$ and $0 < p < \beta$ where $\beta$ is the radix (default to $2^{28}$).
1506 This computes the value required for the modulus $a$ and stores it in $d$. This function cannot fail
1515 This reduces $a$ in place modulo $b$ with the pre--computed value $mp$. $b$ must be of a restricted
1537 This will compute the required $d$ value for the given moduli $a$.
1544 This will reduce $a$ in place modulo $n$ with the pre--computed value $d$. From my experience this routine is
1596 if the function does not return \textbf{MP\_OKAY} the value in ``result'' should be considered undefined\footnote{Currently
1597 the default is to set it to zero first.}.
1604 Performs a Fermat primality test to the base $b$. That is it computes $b^a \mbox{ mod }a$ and tests whether the value is
1642 $1 \le t < PRIME\_SIZE$ where $PRIME\_SIZE$ is the number of primes in the prime number table (by default this is $256$).