Lines Matching refs:they
90 Since both\footnote{Note that the MPI files under mtest/ are copyrighted by Michael Fromberger. They are not required to use LibTomMath.} are in the
91 public domain everyone is entitled to do with them as they see fit.
156 Each phase changes how the library is built and they are applied one after another respectively.
170 which further define symbols. All of the symbols (technically they're macros $\ldots$) represent a given C source
181 They can be enabled at any pass of the configuration phase.
197 Build trims are meant to be defined on the last pass of the configuration which means they are to be defined
321 The last two codes listed are not actually ``return'ed'' by a function. They are placed in an integer (the caller must
442 variables in an ``all or nothing'' fashion. That is, they are either all initialized successfully or they are all
746 Both functions work like the previous counterparts except they first mp\_init $a$ before setting the values.
874 This will compare $a$ to the left of $b$. It will first compare the signs of the two mp\_int variables. If they
1090 While AND, OR and XOR operations are not typical ``bignum functions'' they can be useful in several instances. The
1232 the Comba and baseline algorithms use. At $O(n^{1.464973})$ and $O(n^{1.584962})$ running times respectively they require
1237 So why not always use Karatsuba or Toom-Cook? The simple answer is that they have so much overhead that they're not
1243 exist and for the most part I just set the cutoff points very high to make sure they're not called.
1517 much faster than both Barrett and Montgomery reductions as they have a much lower asymtotic running time.
1529 form $2^k - p$ for $0 < p < \beta$. In this sense the unrestricted reductions are more flexible as they
1765 They operate essentially the same as the unsigned copies except they prefix the data with zero or non--zero
1783 Any of the U1/U2/U3 paramters can be set to \textbf{NULL} if they are not desired.
