Home | History | Annotate | Download | only in libtommath

Lines Matching refs:At

155 LibTomMath can configured at build time in three phases we shall call ``depends'', ``tweaks'' and ``trims''.  
181 They can be enabled at any pass of the configuration phase.
453 at once. If the function returns MP\_OKAY then all of the mp\_int variables are ready to use, otherwise none of them
455 from the heap at the same time.
644 domain of a digit can change (it's always at least $0 \ldots 127$).
1232 the Comba and baseline algorithms use. At $O(n^{1.464973})$ and $O(n^{1.584962})$ running times respectively they require
1239 GCC 3.3.1 and an Athlon XP processor the cutoff point is roughly 110 digits (about 70 for the Intel P4). That is, at
1621 Generally to ensure a number is very likely to be prime you have to perform the Miller-Rabin with at least a half-dozen