Lines Matching +refs:desktop +refs:file +refs:version
208 trivially factored\footnote{A Pollard-Rho factoring would take only $2^{16}$ time.} on the average desktop computer,
475 The code base of LibTomMath is well organized. Each function is in its own separate source code file
477 file which makes the source very easily to follow. By comparison MPI and LIP are single file projects making code tracing
510 LibTomMath will build ``out of the box'' on any platform equipped with a modern version of the GNU C Compiler
767 name represents a constant\footnote{Defined in the ``tommath.h'' header file within LibTomMath.}
2317 Essentially the loop is a generic version of algorithm mp\_mul\_2 designed to handle any shift count in the range $1 \le x < lg(\beta)$. The $mask$
3587 $\left [ 3 \right ] $ & Implement a threaded version of Comba multiplication (and squaring) where you \\
5563 multiplication algorithm. Essentially this algorithm is a modified version of algorithm s\_mp\_mul\_digs where one of the multiplicands
6517 mp\_digit. The table \_\_prime\_tab is defined in the following file.